/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_6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 15:01:22,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 15:01:22,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 15:01:22,146 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 15:01:22,146 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 15:01:22,147 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 15:01:22,148 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 15:01:22,150 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 15:01:22,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 15:01:22,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 15:01:22,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 15:01:22,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 15:01:22,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 15:01:22,163 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 15:01:22,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 15:01:22,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 15:01:22,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 15:01:22,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 15:01:22,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 15:01:22,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 15:01:22,170 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 15:01:22,170 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 15:01:22,171 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 15:01:22,172 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 15:01:22,173 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 15:01:22,175 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 15:01:22,176 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 15:01:22,176 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 15:01:22,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 15:01:22,177 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 15:01:22,177 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 15:01:22,178 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 15:01:22,178 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 15:01:22,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 15:01:22,179 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 15:01:22,180 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 15:01:22,181 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 15:01:22,181 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 15:01:22,181 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 15:01:22,182 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 15:01:22,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 15:01:22,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 15:01:22,184 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 15:01:22,199 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 15:01:22,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 15:01:22,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 15:01:22,201 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 15:01:22,201 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 15:01:22,201 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 15:01:22,201 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 15:01:22,202 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 15:01:22,202 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 15:01:22,202 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 15:01:22,203 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 15:01:22,203 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 15:01:22,203 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 15:01:22,203 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 15:01:22,203 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 15:01:22,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:01:22,204 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 15:01:22,204 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 15:01:22,204 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 15:01:22,204 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 15:01:22,204 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 15:01:22,204 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 15:01:22,204 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-28 15:01:22,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 15:01:22,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 15:01:22,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 15:01:22,425 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 15:01:22,427 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 15:01:22,427 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2022-04-28 15:01:22,485 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e587ea7/2b8b9456d6864de781b0785c7c023f0f/FLAGee3b42fef [2022-04-28 15:01:22,877 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 15:01:22,878 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2022-04-28 15:01:22,884 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e587ea7/2b8b9456d6864de781b0785c7c023f0f/FLAGee3b42fef [2022-04-28 15:01:22,901 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e587ea7/2b8b9456d6864de781b0785c7c023f0f [2022-04-28 15:01:22,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 15:01:22,905 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 15:01:22,906 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 15:01:22,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 15:01:22,910 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 15:01:22,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:01:22" (1/1) ... [2022-04-28 15:01:22,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27b22658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:22, skipping insertion in model container [2022-04-28 15:01:22,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:01:22" (1/1) ... [2022-04-28 15:01:22,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 15:01:22,936 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 15:01:23,112 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_6.c[2544,2557] [2022-04-28 15:01:23,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:01:23,121 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 15:01:23,140 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_6.c[2544,2557] [2022-04-28 15:01:23,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:01:23,152 INFO L208 MainTranslator]: Completed translation [2022-04-28 15:01:23,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:23 WrapperNode [2022-04-28 15:01:23,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 15:01:23,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 15:01:23,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 15:01:23,154 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 15:01:23,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:23" (1/1) ... [2022-04-28 15:01:23,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:23" (1/1) ... [2022-04-28 15:01:23,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:23" (1/1) ... [2022-04-28 15:01:23,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:23" (1/1) ... [2022-04-28 15:01:23,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:23" (1/1) ... [2022-04-28 15:01:23,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:23" (1/1) ... [2022-04-28 15:01:23,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:23" (1/1) ... [2022-04-28 15:01:23,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 15:01:23,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 15:01:23,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 15:01:23,183 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 15:01:23,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:23" (1/1) ... [2022-04-28 15:01:23,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:01:23,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 15:01:23,223 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-28 15:01:23,225 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-28 15:01:23,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 15:01:23,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 15:01:23,255 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 15:01:23,255 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 15:01:23,256 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 15:01:23,256 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 15:01:23,257 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 15:01:23,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 15:01:23,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 15:01:23,257 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 15:01:23,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 15:01:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 15:01:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 15:01:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 15:01:23,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 15:01:23,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 15:01:23,313 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 15:01:23,314 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 15:01:23,462 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 15:01:23,468 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 15:01:23,468 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 15:01:23,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:01:23 BoogieIcfgContainer [2022-04-28 15:01:23,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 15:01:23,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 15:01:23,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 15:01:23,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 15:01:23,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:01:22" (1/3) ... [2022-04-28 15:01:23,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@779f56c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:01:23, skipping insertion in model container [2022-04-28 15:01:23,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:23" (2/3) ... [2022-04-28 15:01:23,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@779f56c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:01:23, skipping insertion in model container [2022-04-28 15:01:23,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:01:23" (3/3) ... [2022-04-28 15:01:23,492 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2022-04-28 15:01:23,503 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 15:01:23,504 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 15:01:23,540 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 15:01:23,546 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@132261ff, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@616f2648 [2022-04-28 15:01:23,546 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 15:01:23,554 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 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-28 15:01:23,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 15:01:23,560 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:23,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:23,561 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:23,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:23,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1747552289, now seen corresponding path program 1 times [2022-04-28 15:01:23,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:23,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [516361458] [2022-04-28 15:01:23,582 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:23,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1747552289, now seen corresponding path program 2 times [2022-04-28 15:01:23,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:23,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712996158] [2022-04-28 15:01:23,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:23,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:23,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:23,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(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(15, 2);call #Ultimate.allocInit(12, 3); {36#true} is VALID [2022-04-28 15:01:23,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-28 15:01:23,805 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #132#return; {36#true} is VALID [2022-04-28 15:01:23,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:23,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(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(15, 2);call #Ultimate.allocInit(12, 3); {36#true} is VALID [2022-04-28 15:01:23,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-28 15:01:23,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #132#return; {36#true} is VALID [2022-04-28 15:01:23,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret11 := main(); {36#true} is VALID [2022-04-28 15:01:23,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#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;havoc ~cond~0; {36#true} is VALID [2022-04-28 15:01:23,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {36#true} is VALID [2022-04-28 15:01:23,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {36#true} is VALID [2022-04-28 15:01:23,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} assume 0 != ~p1~0;~lk1~0 := 1; {41#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:23,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {41#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:23,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {41#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {41#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:23,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {41#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:23,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {41#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:23,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {41#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:23,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#(= main_~lk1~0 1)} assume 0 != ~p1~0; {41#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:23,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {37#false} is VALID [2022-04-28 15:01:23,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-28 15:01:23,814 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-28 15:01:23,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:23,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712996158] [2022-04-28 15:01:23,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712996158] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:23,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:23,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:23,818 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:23,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [516361458] [2022-04-28 15:01:23,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [516361458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:23,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:23,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:23,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44744628] [2022-04-28 15:01:23,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:23,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 15:01:23,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:23,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:23,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:23,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:23,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:23,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:23,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:23,915 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 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 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:24,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:24,176 INFO L93 Difference]: Finished difference Result 64 states and 103 transitions. [2022-04-28 15:01:24,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:24,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 15:01:24,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:24,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:24,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-28 15:01:24,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:24,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-28 15:01:24,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-28 15:01:24,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:24,304 INFO L225 Difference]: With dead ends: 64 [2022-04-28 15:01:24,305 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 15:01:24,307 INFO L412 NwaCegarLoop]: 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-28 15:01:24,310 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 106 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:24,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 65 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 15:01:24,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 15:01:24,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2022-04-28 15:01:24,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:24,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:24,341 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:24,342 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:24,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:24,348 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. [2022-04-28 15:01:24,348 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 81 transitions. [2022-04-28 15:01:24,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:24,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:24,350 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-28 15:01:24,350 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-28 15:01:24,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:24,354 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. [2022-04-28 15:01:24,355 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 81 transitions. [2022-04-28 15:01:24,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:24,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:24,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:24,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:24,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2022-04-28 15:01:24,360 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 17 [2022-04-28 15:01:24,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:24,360 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 58 transitions. [2022-04-28 15:01:24,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:24,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 58 transitions. [2022-04-28 15:01:24,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:24,431 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2022-04-28 15:01:24,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 15:01:24,438 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:24,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:24,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 15:01:24,439 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:24,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:24,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1867356637, now seen corresponding path program 1 times [2022-04-28 15:01:24,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:24,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1896513976] [2022-04-28 15:01:24,444 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:24,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1867356637, now seen corresponding path program 2 times [2022-04-28 15:01:24,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:24,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675161441] [2022-04-28 15:01:24,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:24,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:24,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:24,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {350#(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(15, 2);call #Ultimate.allocInit(12, 3); {344#true} is VALID [2022-04-28 15:01:24,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {344#true} assume true; {344#true} is VALID [2022-04-28 15:01:24,548 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {344#true} {344#true} #132#return; {344#true} is VALID [2022-04-28 15:01:24,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {344#true} call ULTIMATE.init(); {350#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:24,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {350#(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(15, 2);call #Ultimate.allocInit(12, 3); {344#true} is VALID [2022-04-28 15:01:24,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {344#true} assume true; {344#true} is VALID [2022-04-28 15:01:24,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {344#true} {344#true} #132#return; {344#true} is VALID [2022-04-28 15:01:24,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {344#true} call #t~ret11 := main(); {344#true} is VALID [2022-04-28 15:01:24,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {344#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;havoc ~cond~0; {344#true} is VALID [2022-04-28 15:01:24,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {344#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {344#true} is VALID [2022-04-28 15:01:24,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {344#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {344#true} is VALID [2022-04-28 15:01:24,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {344#true} assume !(0 != ~p1~0); {349#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:24,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {349#(= main_~p1~0 0)} assume !(0 != ~p2~0); {349#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:24,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {349#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {349#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:24,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {349#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {349#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:24,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {349#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {349#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:24,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {349#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {349#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:24,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {349#(= main_~p1~0 0)} assume 0 != ~p1~0; {345#false} is VALID [2022-04-28 15:01:24,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {345#false} assume 1 != ~lk1~0; {345#false} is VALID [2022-04-28 15:01:24,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {345#false} assume !false; {345#false} is VALID [2022-04-28 15:01:24,553 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-28 15:01:24,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:24,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675161441] [2022-04-28 15:01:24,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675161441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:24,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:24,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:24,554 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:24,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1896513976] [2022-04-28 15:01:24,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1896513976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:24,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:24,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:24,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70520200] [2022-04-28 15:01:24,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:24,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 15:01:24,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:24,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:24,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:24,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:24,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:24,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:24,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:24,573 INFO L87 Difference]: Start difference. First operand 35 states and 58 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:24,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:24,769 INFO L93 Difference]: Finished difference Result 78 states and 133 transitions. [2022-04-28 15:01:24,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:24,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 15:01:24,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:24,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-04-28 15:01:24,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:24,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-04-28 15:01:24,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 120 transitions. [2022-04-28 15:01:24,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:24,887 INFO L225 Difference]: With dead ends: 78 [2022-04-28 15:01:24,888 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 15:01:24,889 INFO L412 NwaCegarLoop]: 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-28 15:01:24,892 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:24,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 63 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:24,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 15:01:24,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-04-28 15:01:24,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:24,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:24,913 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:24,915 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:24,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:24,921 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. [2022-04-28 15:01:24,921 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2022-04-28 15:01:24,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:24,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:24,922 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-28 15:01:24,922 INFO L87 Difference]: Start difference. First operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-28 15:01:24,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:24,926 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. [2022-04-28 15:01:24,926 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2022-04-28 15:01:24,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:24,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:24,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:24,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:24,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 78 transitions. [2022-04-28 15:01:24,935 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 78 transitions. Word has length 17 [2022-04-28 15:01:24,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:24,935 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 78 transitions. [2022-04-28 15:01:24,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:24,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 78 transitions. [2022-04-28 15:01:25,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:25,018 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 78 transitions. [2022-04-28 15:01:25,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 15:01:25,024 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:25,024 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:25,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 15:01:25,028 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:25,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:25,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1660239210, now seen corresponding path program 1 times [2022-04-28 15:01:25,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:25,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [408951259] [2022-04-28 15:01:25,031 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:25,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1660239210, now seen corresponding path program 2 times [2022-04-28 15:01:25,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:25,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424052976] [2022-04-28 15:01:25,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:25,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:25,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:25,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {710#(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(15, 2);call #Ultimate.allocInit(12, 3); {704#true} is VALID [2022-04-28 15:01:25,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {704#true} assume true; {704#true} is VALID [2022-04-28 15:01:25,107 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {704#true} {704#true} #132#return; {704#true} is VALID [2022-04-28 15:01:25,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {704#true} call ULTIMATE.init(); {710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:25,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {710#(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(15, 2);call #Ultimate.allocInit(12, 3); {704#true} is VALID [2022-04-28 15:01:25,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {704#true} assume true; {704#true} is VALID [2022-04-28 15:01:25,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {704#true} {704#true} #132#return; {704#true} is VALID [2022-04-28 15:01:25,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {704#true} call #t~ret11 := main(); {704#true} is VALID [2022-04-28 15:01:25,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {704#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;havoc ~cond~0; {704#true} is VALID [2022-04-28 15:01:25,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {704#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {704#true} is VALID [2022-04-28 15:01:25,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {704#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {704#true} is VALID [2022-04-28 15:01:25,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {704#true} assume 0 != ~p1~0;~lk1~0 := 1; {709#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:25,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {709#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {709#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:25,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {709#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {709#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:25,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {709#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {709#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:25,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {709#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {709#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:25,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {709#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {709#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:25,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {709#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {705#false} is VALID [2022-04-28 15:01:25,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {705#false} assume 0 != ~p2~0; {705#false} is VALID [2022-04-28 15:01:25,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {705#false} assume 1 != ~lk2~0; {705#false} is VALID [2022-04-28 15:01:25,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {705#false} assume !false; {705#false} is VALID [2022-04-28 15:01:25,116 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-28 15:01:25,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:25,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424052976] [2022-04-28 15:01:25,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424052976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:25,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:25,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:25,117 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:25,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [408951259] [2022-04-28 15:01:25,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [408951259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:25,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:25,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:25,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807413419] [2022-04-28 15:01:25,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:25,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 15:01:25,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:25,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:25,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:25,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:25,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:25,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:25,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:25,132 INFO L87 Difference]: Start difference. First operand 47 states and 78 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:25,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:25,260 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2022-04-28 15:01:25,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:25,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 15:01:25,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:25,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:25,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-28 15:01:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:25,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-28 15:01:25,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-28 15:01:25,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:25,364 INFO L225 Difference]: With dead ends: 73 [2022-04-28 15:01:25,364 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 15:01:25,364 INFO L412 NwaCegarLoop]: 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-28 15:01:25,365 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:25,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 73 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:25,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 15:01:25,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-04-28 15:01:25,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:25,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:25,373 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:25,374 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:25,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:25,376 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2022-04-28 15:01:25,376 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 81 transitions. [2022-04-28 15:01:25,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:25,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:25,376 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-28 15:01:25,377 INFO L87 Difference]: Start difference. First operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-28 15:01:25,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:25,379 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2022-04-28 15:01:25,379 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 81 transitions. [2022-04-28 15:01:25,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:25,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:25,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:25,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:25,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:25,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 80 transitions. [2022-04-28 15:01:25,382 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 80 transitions. Word has length 18 [2022-04-28 15:01:25,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:25,382 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 80 transitions. [2022-04-28 15:01:25,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:25,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 80 transitions. [2022-04-28 15:01:25,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:25,459 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 80 transitions. [2022-04-28 15:01:25,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 15:01:25,459 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:25,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:25,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 15:01:25,460 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:25,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:25,460 INFO L85 PathProgramCache]: Analyzing trace with hash -2053266220, now seen corresponding path program 1 times [2022-04-28 15:01:25,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:25,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [610396323] [2022-04-28 15:01:25,461 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:25,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2053266220, now seen corresponding path program 2 times [2022-04-28 15:01:25,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:25,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153347101] [2022-04-28 15:01:25,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:25,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:25,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:25,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {1072#(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(15, 2);call #Ultimate.allocInit(12, 3); {1066#true} is VALID [2022-04-28 15:01:25,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-28 15:01:25,519 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1066#true} {1066#true} #132#return; {1066#true} is VALID [2022-04-28 15:01:25,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {1066#true} call ULTIMATE.init(); {1072#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:25,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#(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(15, 2);call #Ultimate.allocInit(12, 3); {1066#true} is VALID [2022-04-28 15:01:25,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-28 15:01:25,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1066#true} {1066#true} #132#return; {1066#true} is VALID [2022-04-28 15:01:25,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {1066#true} call #t~ret11 := main(); {1066#true} is VALID [2022-04-28 15:01:25,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {1066#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;havoc ~cond~0; {1066#true} is VALID [2022-04-28 15:01:25,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {1066#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {1066#true} is VALID [2022-04-28 15:01:25,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {1066#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {1066#true} is VALID [2022-04-28 15:01:25,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {1066#true} assume !(0 != ~p1~0); {1066#true} is VALID [2022-04-28 15:01:25,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {1066#true} assume !(0 != ~p2~0); {1071#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:25,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {1071#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1071#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:25,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {1071#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1071#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:25,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {1071#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1071#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:25,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {1071#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1071#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:25,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {1071#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1071#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:25,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {1071#(= main_~p2~0 0)} assume 0 != ~p2~0; {1067#false} is VALID [2022-04-28 15:01:25,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {1067#false} assume 1 != ~lk2~0; {1067#false} is VALID [2022-04-28 15:01:25,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {1067#false} assume !false; {1067#false} is VALID [2022-04-28 15:01:25,528 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-28 15:01:25,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:25,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153347101] [2022-04-28 15:01:25,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153347101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:25,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:25,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:25,528 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:25,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [610396323] [2022-04-28 15:01:25,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [610396323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:25,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:25,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:25,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824915322] [2022-04-28 15:01:25,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:25,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 15:01:25,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:25,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:25,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:25,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:25,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:25,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:25,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:25,547 INFO L87 Difference]: Start difference. First operand 50 states and 80 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:25,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:25,685 INFO L93 Difference]: Finished difference Result 130 states and 216 transitions. [2022-04-28 15:01:25,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:25,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 15:01:25,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:25,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:25,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-28 15:01:25,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:25,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-28 15:01:25,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 118 transitions. [2022-04-28 15:01:25,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:25,779 INFO L225 Difference]: With dead ends: 130 [2022-04-28 15:01:25,779 INFO L226 Difference]: Without dead ends: 89 [2022-04-28 15:01:25,779 INFO L412 NwaCegarLoop]: 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-28 15:01:25,780 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 95 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:25,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 55 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:25,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-28 15:01:25,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-04-28 15:01:25,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:25,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:25,793 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:25,793 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:25,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:25,796 INFO L93 Difference]: Finished difference Result 89 states and 142 transitions. [2022-04-28 15:01:25,796 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 142 transitions. [2022-04-28 15:01:25,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:25,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:25,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-28 15:01:25,797 INFO L87 Difference]: Start difference. First operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-28 15:01:25,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:25,800 INFO L93 Difference]: Finished difference Result 89 states and 142 transitions. [2022-04-28 15:01:25,800 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 142 transitions. [2022-04-28 15:01:25,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:25,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:25,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:25,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:25,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:25,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 141 transitions. [2022-04-28 15:01:25,804 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 141 transitions. Word has length 18 [2022-04-28 15:01:25,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:25,804 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 141 transitions. [2022-04-28 15:01:25,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:25,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 141 transitions. [2022-04-28 15:01:25,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:25,932 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 141 transitions. [2022-04-28 15:01:25,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 15:01:25,932 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:25,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:25,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 15:01:25,933 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:25,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:25,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1561642706, now seen corresponding path program 1 times [2022-04-28 15:01:25,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:25,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1435090954] [2022-04-28 15:01:25,934 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:25,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1561642706, now seen corresponding path program 2 times [2022-04-28 15:01:25,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:25,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424377673] [2022-04-28 15:01:25,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:25,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:25,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:26,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {1696#(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(15, 2);call #Ultimate.allocInit(12, 3); {1690#true} is VALID [2022-04-28 15:01:26,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {1690#true} assume true; {1690#true} is VALID [2022-04-28 15:01:26,010 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1690#true} {1690#true} #132#return; {1690#true} is VALID [2022-04-28 15:01:26,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {1690#true} call ULTIMATE.init(); {1696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:26,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {1696#(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(15, 2);call #Ultimate.allocInit(12, 3); {1690#true} is VALID [2022-04-28 15:01:26,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {1690#true} assume true; {1690#true} is VALID [2022-04-28 15:01:26,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1690#true} {1690#true} #132#return; {1690#true} is VALID [2022-04-28 15:01:26,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {1690#true} call #t~ret11 := main(); {1690#true} is VALID [2022-04-28 15:01:26,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {1690#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;havoc ~cond~0; {1690#true} is VALID [2022-04-28 15:01:26,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {1690#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {1690#true} is VALID [2022-04-28 15:01:26,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {1690#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {1690#true} is VALID [2022-04-28 15:01:26,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {1690#true} assume !(0 != ~p1~0); {1690#true} is VALID [2022-04-28 15:01:26,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {1690#true} assume 0 != ~p2~0;~lk2~0 := 1; {1695#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:26,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {1695#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {1695#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:26,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {1695#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1695#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:26,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {1695#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1695#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:26,014 INFO L290 TraceCheckUtils]: 13: Hoare triple {1695#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {1695#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:26,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {1695#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {1695#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:26,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {1695#(= main_~lk2~0 1)} assume 0 != ~p2~0; {1695#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:26,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {1695#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {1691#false} is VALID [2022-04-28 15:01:26,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {1691#false} assume !false; {1691#false} is VALID [2022-04-28 15:01:26,018 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-28 15:01:26,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:26,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424377673] [2022-04-28 15:01:26,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424377673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:26,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:26,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:26,018 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:26,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1435090954] [2022-04-28 15:01:26,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1435090954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:26,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:26,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:26,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632666908] [2022-04-28 15:01:26,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:26,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 15:01:26,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:26,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:26,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:26,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:26,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:26,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:26,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:26,034 INFO L87 Difference]: Start difference. First operand 87 states and 141 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:26,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:26,156 INFO L93 Difference]: Finished difference Result 111 states and 179 transitions. [2022-04-28 15:01:26,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:26,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 15:01:26,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:26,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:26,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-04-28 15:01:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-04-28 15:01:26,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 76 transitions. [2022-04-28 15:01:26,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:26,222 INFO L225 Difference]: With dead ends: 111 [2022-04-28 15:01:26,222 INFO L226 Difference]: Without dead ends: 109 [2022-04-28 15:01:26,222 INFO L412 NwaCegarLoop]: 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-28 15:01:26,223 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 62 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:26,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 80 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:26,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-28 15:01:26,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2022-04-28 15:01:26,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:26,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:26,235 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:26,235 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:26,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:26,239 INFO L93 Difference]: Finished difference Result 109 states and 176 transitions. [2022-04-28 15:01:26,239 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 176 transitions. [2022-04-28 15:01:26,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:26,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:26,240 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states. [2022-04-28 15:01:26,240 INFO L87 Difference]: Start difference. First operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states. [2022-04-28 15:01:26,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:26,244 INFO L93 Difference]: Finished difference Result 109 states and 176 transitions. [2022-04-28 15:01:26,244 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 176 transitions. [2022-04-28 15:01:26,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:26,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:26,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:26,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:26,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:26,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 139 transitions. [2022-04-28 15:01:26,248 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 139 transitions. Word has length 18 [2022-04-28 15:01:26,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:26,248 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 139 transitions. [2022-04-28 15:01:26,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:26,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 139 transitions. [2022-04-28 15:01:26,379 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-28 15:01:26,379 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 139 transitions. [2022-04-28 15:01:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 15:01:26,380 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:26,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:26,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 15:01:26,380 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:26,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:26,381 INFO L85 PathProgramCache]: Analyzing trace with hash 773471640, now seen corresponding path program 1 times [2022-04-28 15:01:26,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:26,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [381305920] [2022-04-28 15:01:26,381 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:26,381 INFO L85 PathProgramCache]: Analyzing trace with hash 773471640, now seen corresponding path program 2 times [2022-04-28 15:01:26,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:26,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86460810] [2022-04-28 15:01:26,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:26,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:26,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:26,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {2322#(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(15, 2);call #Ultimate.allocInit(12, 3); {2316#true} is VALID [2022-04-28 15:01:26,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {2316#true} assume true; {2316#true} is VALID [2022-04-28 15:01:26,421 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2316#true} {2316#true} #132#return; {2316#true} is VALID [2022-04-28 15:01:26,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {2316#true} call ULTIMATE.init(); {2322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:26,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {2322#(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(15, 2);call #Ultimate.allocInit(12, 3); {2316#true} is VALID [2022-04-28 15:01:26,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {2316#true} assume true; {2316#true} is VALID [2022-04-28 15:01:26,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2316#true} {2316#true} #132#return; {2316#true} is VALID [2022-04-28 15:01:26,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {2316#true} call #t~ret11 := main(); {2316#true} is VALID [2022-04-28 15:01:26,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {2316#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;havoc ~cond~0; {2316#true} is VALID [2022-04-28 15:01:26,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {2316#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {2316#true} is VALID [2022-04-28 15:01:26,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {2316#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {2316#true} is VALID [2022-04-28 15:01:26,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {2316#true} assume !(0 != ~p1~0); {2316#true} is VALID [2022-04-28 15:01:26,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {2316#true} assume !(0 != ~p2~0); {2316#true} is VALID [2022-04-28 15:01:26,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {2316#true} assume 0 != ~p3~0;~lk3~0 := 1; {2321#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:26,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {2321#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2321#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:26,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {2321#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2321#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:26,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {2321#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2321#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:26,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {2321#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2321#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:26,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {2321#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2321#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:26,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {2321#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2321#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:26,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {2321#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2317#false} is VALID [2022-04-28 15:01:26,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {2317#false} assume !false; {2317#false} is VALID [2022-04-28 15:01:26,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:01:26,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:26,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86460810] [2022-04-28 15:01:26,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86460810] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:26,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:26,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:26,427 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:26,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [381305920] [2022-04-28 15:01:26,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [381305920] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:26,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:26,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:26,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933558949] [2022-04-28 15:01:26,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:26,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 15:01:26,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:26,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:26,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:26,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:26,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:26,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:26,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:26,442 INFO L87 Difference]: Start difference. First operand 87 states and 139 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:26,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:26,583 INFO L93 Difference]: Finished difference Result 155 states and 251 transitions. [2022-04-28 15:01:26,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:26,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 15:01:26,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:26,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:26,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-28 15:01:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-28 15:01:26,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 75 transitions. [2022-04-28 15:01:26,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:26,657 INFO L225 Difference]: With dead ends: 155 [2022-04-28 15:01:26,657 INFO L226 Difference]: Without dead ends: 153 [2022-04-28 15:01:26,657 INFO L412 NwaCegarLoop]: 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-28 15:01:26,659 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 86 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:26,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 52 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:26,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-04-28 15:01:26,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 119. [2022-04-28 15:01:26,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:26,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:26,685 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:26,685 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:26,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:26,690 INFO L93 Difference]: Finished difference Result 153 states and 246 transitions. [2022-04-28 15:01:26,690 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 246 transitions. [2022-04-28 15:01:26,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:26,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:26,691 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 153 states. [2022-04-28 15:01:26,692 INFO L87 Difference]: Start difference. First operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 153 states. [2022-04-28 15:01:26,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:26,697 INFO L93 Difference]: Finished difference Result 153 states and 246 transitions. [2022-04-28 15:01:26,697 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 246 transitions. [2022-04-28 15:01:26,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:26,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:26,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:26,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:26,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:26,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 189 transitions. [2022-04-28 15:01:26,703 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 189 transitions. Word has length 19 [2022-04-28 15:01:26,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:26,703 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 189 transitions. [2022-04-28 15:01:26,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:26,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 189 transitions. [2022-04-28 15:01:26,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:26,909 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 189 transitions. [2022-04-28 15:01:26,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 15:01:26,910 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:26,910 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:26,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 15:01:26,910 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:26,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:26,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1453530010, now seen corresponding path program 1 times [2022-04-28 15:01:26,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:26,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [735558091] [2022-04-28 15:01:26,912 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:26,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1453530010, now seen corresponding path program 2 times [2022-04-28 15:01:26,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:26,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781670072] [2022-04-28 15:01:26,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:26,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:26,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:26,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {3188#(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(15, 2);call #Ultimate.allocInit(12, 3); {3182#true} is VALID [2022-04-28 15:01:26,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-28 15:01:26,979 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3182#true} {3182#true} #132#return; {3182#true} is VALID [2022-04-28 15:01:26,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {3182#true} call ULTIMATE.init(); {3188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:26,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {3188#(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(15, 2);call #Ultimate.allocInit(12, 3); {3182#true} is VALID [2022-04-28 15:01:26,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-28 15:01:26,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3182#true} {3182#true} #132#return; {3182#true} is VALID [2022-04-28 15:01:26,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {3182#true} call #t~ret11 := main(); {3182#true} is VALID [2022-04-28 15:01:26,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {3182#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;havoc ~cond~0; {3182#true} is VALID [2022-04-28 15:01:26,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {3182#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {3182#true} is VALID [2022-04-28 15:01:26,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {3182#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {3182#true} is VALID [2022-04-28 15:01:26,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {3182#true} assume !(0 != ~p1~0); {3182#true} is VALID [2022-04-28 15:01:26,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {3182#true} assume !(0 != ~p2~0); {3182#true} is VALID [2022-04-28 15:01:26,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {3182#true} assume !(0 != ~p3~0); {3187#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:26,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {3187#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {3187#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:26,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {3187#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {3187#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:26,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {3187#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {3187#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:26,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {3187#(= main_~p3~0 0)} assume !(0 != ~p1~0); {3187#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:26,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {3187#(= main_~p3~0 0)} assume !(0 != ~p2~0); {3187#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:26,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {3187#(= main_~p3~0 0)} assume 0 != ~p3~0; {3183#false} is VALID [2022-04-28 15:01:26,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {3183#false} assume 1 != ~lk3~0; {3183#false} is VALID [2022-04-28 15:01:26,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {3183#false} assume !false; {3183#false} is VALID [2022-04-28 15:01:26,984 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-28 15:01:26,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:26,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781670072] [2022-04-28 15:01:26,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781670072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:26,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:26,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:26,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:26,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [735558091] [2022-04-28 15:01:26,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [735558091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:26,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:26,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:26,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779467737] [2022-04-28 15:01:26,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:26,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 15:01:26,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:26,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:26,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:26,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:26,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:26,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:26,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:27,000 INFO L87 Difference]: Start difference. First operand 119 states and 189 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:27,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:27,124 INFO L93 Difference]: Finished difference Result 271 states and 435 transitions. [2022-04-28 15:01:27,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:27,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 15:01:27,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:27,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-28 15:01:27,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-28 15:01:27,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 114 transitions. [2022-04-28 15:01:27,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:27,225 INFO L225 Difference]: With dead ends: 271 [2022-04-28 15:01:27,225 INFO L226 Difference]: Without dead ends: 161 [2022-04-28 15:01:27,226 INFO L412 NwaCegarLoop]: 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-28 15:01:27,227 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:27,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 67 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:27,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-28 15:01:27,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2022-04-28 15:01:27,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:27,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:27,248 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:27,248 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:27,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:27,252 INFO L93 Difference]: Finished difference Result 161 states and 248 transitions. [2022-04-28 15:01:27,253 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 248 transitions. [2022-04-28 15:01:27,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:27,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:27,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states 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-28 15:01:27,254 INFO L87 Difference]: Start difference. First operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states 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-28 15:01:27,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:27,258 INFO L93 Difference]: Finished difference Result 161 states and 248 transitions. [2022-04-28 15:01:27,258 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 248 transitions. [2022-04-28 15:01:27,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:27,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:27,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:27,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:27,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:27,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 247 transitions. [2022-04-28 15:01:27,264 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 247 transitions. Word has length 19 [2022-04-28 15:01:27,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:27,264 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 247 transitions. [2022-04-28 15:01:27,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:27,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 247 transitions. [2022-04-28 15:01:27,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:27,546 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 247 transitions. [2022-04-28 15:01:27,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 15:01:27,547 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:27,547 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:27,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 15:01:27,547 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:27,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:27,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1791967575, now seen corresponding path program 1 times [2022-04-28 15:01:27,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:27,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1160230934] [2022-04-28 15:01:27,548 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:27,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1791967575, now seen corresponding path program 2 times [2022-04-28 15:01:27,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:27,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228005995] [2022-04-28 15:01:27,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:27,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:27,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:27,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {4382#(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(15, 2);call #Ultimate.allocInit(12, 3); {4376#true} is VALID [2022-04-28 15:01:27,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {4376#true} assume true; {4376#true} is VALID [2022-04-28 15:01:27,584 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4376#true} {4376#true} #132#return; {4376#true} is VALID [2022-04-28 15:01:27,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {4376#true} call ULTIMATE.init(); {4382#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:27,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {4382#(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(15, 2);call #Ultimate.allocInit(12, 3); {4376#true} is VALID [2022-04-28 15:01:27,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {4376#true} assume true; {4376#true} is VALID [2022-04-28 15:01:27,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4376#true} {4376#true} #132#return; {4376#true} is VALID [2022-04-28 15:01:27,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {4376#true} call #t~ret11 := main(); {4376#true} is VALID [2022-04-28 15:01:27,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {4376#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;havoc ~cond~0; {4376#true} is VALID [2022-04-28 15:01:27,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {4376#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {4376#true} is VALID [2022-04-28 15:01:27,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {4376#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {4376#true} is VALID [2022-04-28 15:01:27,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {4376#true} assume !(0 != ~p1~0); {4376#true} is VALID [2022-04-28 15:01:27,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {4376#true} assume !(0 != ~p2~0); {4376#true} is VALID [2022-04-28 15:01:27,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {4376#true} assume 0 != ~p3~0;~lk3~0 := 1; {4381#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:27,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {4381#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {4381#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:27,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {4381#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {4381#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:27,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {4381#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {4381#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:27,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {4381#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {4381#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:27,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {4381#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {4381#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:27,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {4381#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {4377#false} is VALID [2022-04-28 15:01:27,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {4377#false} assume 0 != ~p4~0; {4377#false} is VALID [2022-04-28 15:01:27,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {4377#false} assume 1 != ~lk4~0; {4377#false} is VALID [2022-04-28 15:01:27,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {4377#false} assume !false; {4377#false} is VALID [2022-04-28 15:01:27,589 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-28 15:01:27,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:27,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228005995] [2022-04-28 15:01:27,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228005995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:27,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:27,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:27,590 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:27,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1160230934] [2022-04-28 15:01:27,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1160230934] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:27,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:27,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:27,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830988019] [2022-04-28 15:01:27,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:27,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 15:01:27,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:27,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:27,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:27,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:27,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:27,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:27,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:27,607 INFO L87 Difference]: Start difference. First operand 159 states and 247 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:27,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:27,733 INFO L93 Difference]: Finished difference Result 241 states and 373 transitions. [2022-04-28 15:01:27,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:27,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 15:01:27,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:27,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:27,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-28 15:01:27,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-28 15:01:27,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 109 transitions. [2022-04-28 15:01:27,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:27,831 INFO L225 Difference]: With dead ends: 241 [2022-04-28 15:01:27,831 INFO L226 Difference]: Without dead ends: 167 [2022-04-28 15:01:27,831 INFO L412 NwaCegarLoop]: 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-28 15:01:27,832 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 77 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:27,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 67 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:27,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-28 15:01:27,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2022-04-28 15:01:27,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:27,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:27,847 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:27,847 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:27,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:27,852 INFO L93 Difference]: Finished difference Result 167 states and 252 transitions. [2022-04-28 15:01:27,852 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 252 transitions. [2022-04-28 15:01:27,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:27,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:27,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-28 15:01:27,853 INFO L87 Difference]: Start difference. First operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-28 15:01:27,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:27,858 INFO L93 Difference]: Finished difference Result 167 states and 252 transitions. [2022-04-28 15:01:27,858 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 252 transitions. [2022-04-28 15:01:27,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:27,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:27,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:27,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:27,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 251 transitions. [2022-04-28 15:01:27,864 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 251 transitions. Word has length 20 [2022-04-28 15:01:27,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:27,864 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 251 transitions. [2022-04-28 15:01:27,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:27,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 165 states and 251 transitions. [2022-04-28 15:01:28,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:28,125 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 251 transitions. [2022-04-28 15:01:28,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 15:01:28,125 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:28,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:28,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 15:01:28,126 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:28,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:28,126 INFO L85 PathProgramCache]: Analyzing trace with hash 2109972711, now seen corresponding path program 1 times [2022-04-28 15:01:28,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:28,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [76968458] [2022-04-28 15:01:28,127 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:28,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2109972711, now seen corresponding path program 2 times [2022-04-28 15:01:28,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:28,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869563415] [2022-04-28 15:01:28,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:28,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:28,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:28,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {5540#(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(15, 2);call #Ultimate.allocInit(12, 3); {5534#true} is VALID [2022-04-28 15:01:28,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {5534#true} assume true; {5534#true} is VALID [2022-04-28 15:01:28,172 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5534#true} {5534#true} #132#return; {5534#true} is VALID [2022-04-28 15:01:28,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {5534#true} call ULTIMATE.init(); {5540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:28,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {5540#(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(15, 2);call #Ultimate.allocInit(12, 3); {5534#true} is VALID [2022-04-28 15:01:28,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {5534#true} assume true; {5534#true} is VALID [2022-04-28 15:01:28,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5534#true} {5534#true} #132#return; {5534#true} is VALID [2022-04-28 15:01:28,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {5534#true} call #t~ret11 := main(); {5534#true} is VALID [2022-04-28 15:01:28,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {5534#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;havoc ~cond~0; {5534#true} is VALID [2022-04-28 15:01:28,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {5534#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {5534#true} is VALID [2022-04-28 15:01:28,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {5534#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {5534#true} is VALID [2022-04-28 15:01:28,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {5534#true} assume !(0 != ~p1~0); {5534#true} is VALID [2022-04-28 15:01:28,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {5534#true} assume !(0 != ~p2~0); {5534#true} is VALID [2022-04-28 15:01:28,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {5534#true} assume !(0 != ~p3~0); {5534#true} is VALID [2022-04-28 15:01:28,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {5534#true} assume 0 != ~p4~0;~lk4~0 := 1; {5539#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:28,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {5539#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {5539#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:28,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {5539#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {5539#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:28,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {5539#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {5539#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:28,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {5539#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {5539#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:28,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {5539#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {5539#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:28,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {5539#(= main_~lk4~0 1)} assume 0 != ~p4~0; {5539#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:28,181 INFO L290 TraceCheckUtils]: 18: Hoare triple {5539#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {5535#false} is VALID [2022-04-28 15:01:28,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {5535#false} assume !false; {5535#false} is VALID [2022-04-28 15:01:28,181 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-28 15:01:28,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:28,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869563415] [2022-04-28 15:01:28,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869563415] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:28,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:28,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:28,182 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:28,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [76968458] [2022-04-28 15:01:28,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [76968458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:28,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:28,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:28,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149624338] [2022-04-28 15:01:28,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:28,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 15:01:28,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:28,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:28,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:28,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:28,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:28,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:28,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:28,202 INFO L87 Difference]: Start difference. First operand 165 states and 251 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:28,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:28,342 INFO L93 Difference]: Finished difference Result 285 states and 437 transitions. [2022-04-28 15:01:28,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:28,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 15:01:28,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:28,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:28,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-28 15:01:28,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:28,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-28 15:01:28,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2022-04-28 15:01:28,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:28,413 INFO L225 Difference]: With dead ends: 285 [2022-04-28 15:01:28,413 INFO L226 Difference]: Without dead ends: 283 [2022-04-28 15:01:28,413 INFO L412 NwaCegarLoop]: 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-28 15:01:28,414 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:28,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 51 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:28,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-04-28 15:01:28,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 233. [2022-04-28 15:01:28,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:28,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:28,464 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:28,465 INFO L87 Difference]: Start difference. First operand 283 states. Second operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:28,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:28,472 INFO L93 Difference]: Finished difference Result 283 states and 428 transitions. [2022-04-28 15:01:28,472 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 428 transitions. [2022-04-28 15:01:28,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:28,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:28,474 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 283 states. [2022-04-28 15:01:28,474 INFO L87 Difference]: Start difference. First operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 283 states. [2022-04-28 15:01:28,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:28,481 INFO L93 Difference]: Finished difference Result 283 states and 428 transitions. [2022-04-28 15:01:28,481 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 428 transitions. [2022-04-28 15:01:28,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:28,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:28,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:28,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:28,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:28,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 347 transitions. [2022-04-28 15:01:28,488 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 347 transitions. Word has length 20 [2022-04-28 15:01:28,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:28,488 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 347 transitions. [2022-04-28 15:01:28,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:28,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 233 states and 347 transitions. [2022-04-28 15:01:28,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 347 edges. 347 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 347 transitions. [2022-04-28 15:01:28,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 15:01:28,832 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:28,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:28,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 15:01:28,833 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:28,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:28,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1504936215, now seen corresponding path program 1 times [2022-04-28 15:01:28,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:28,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [331105666] [2022-04-28 15:01:28,833 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:28,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1504936215, now seen corresponding path program 2 times [2022-04-28 15:01:28,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:28,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325416611] [2022-04-28 15:01:28,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:28,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:28,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:28,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {7154#(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(15, 2);call #Ultimate.allocInit(12, 3); {7148#true} is VALID [2022-04-28 15:01:28,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {7148#true} assume true; {7148#true} is VALID [2022-04-28 15:01:28,877 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7148#true} {7148#true} #132#return; {7148#true} is VALID [2022-04-28 15:01:28,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {7148#true} call ULTIMATE.init(); {7154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:28,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {7154#(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(15, 2);call #Ultimate.allocInit(12, 3); {7148#true} is VALID [2022-04-28 15:01:28,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {7148#true} assume true; {7148#true} is VALID [2022-04-28 15:01:28,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7148#true} {7148#true} #132#return; {7148#true} is VALID [2022-04-28 15:01:28,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {7148#true} call #t~ret11 := main(); {7148#true} is VALID [2022-04-28 15:01:28,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {7148#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;havoc ~cond~0; {7148#true} is VALID [2022-04-28 15:01:28,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {7148#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {7148#true} is VALID [2022-04-28 15:01:28,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {7148#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {7148#true} is VALID [2022-04-28 15:01:28,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {7148#true} assume !(0 != ~p1~0); {7148#true} is VALID [2022-04-28 15:01:28,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {7148#true} assume !(0 != ~p2~0); {7148#true} is VALID [2022-04-28 15:01:28,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {7148#true} assume !(0 != ~p3~0); {7148#true} is VALID [2022-04-28 15:01:28,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {7148#true} assume !(0 != ~p4~0); {7153#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:28,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {7153#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {7153#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:28,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {7153#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {7153#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:28,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {7153#(= main_~p4~0 0)} assume !(0 != ~p1~0); {7153#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:28,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {7153#(= main_~p4~0 0)} assume !(0 != ~p2~0); {7153#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:28,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {7153#(= main_~p4~0 0)} assume !(0 != ~p3~0); {7153#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:28,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {7153#(= main_~p4~0 0)} assume 0 != ~p4~0; {7149#false} is VALID [2022-04-28 15:01:28,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {7149#false} assume 1 != ~lk4~0; {7149#false} is VALID [2022-04-28 15:01:28,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {7149#false} assume !false; {7149#false} is VALID [2022-04-28 15:01:28,887 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-28 15:01:28,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:28,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325416611] [2022-04-28 15:01:28,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325416611] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:28,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:28,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:28,887 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:28,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [331105666] [2022-04-28 15:01:28,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [331105666] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:28,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:28,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:28,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765098077] [2022-04-28 15:01:28,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:28,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 15:01:28,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:28,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:28,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:28,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:28,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:28,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:28,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:28,902 INFO L87 Difference]: Start difference. First operand 233 states and 347 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:29,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:29,038 INFO L93 Difference]: Finished difference Result 525 states and 781 transitions. [2022-04-28 15:01:29,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:29,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 15:01:29,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:29,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:29,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-28 15:01:29,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:29,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-28 15:01:29,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-28 15:01:29,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:29,125 INFO L225 Difference]: With dead ends: 525 [2022-04-28 15:01:29,125 INFO L226 Difference]: Without dead ends: 307 [2022-04-28 15:01:29,127 INFO L412 NwaCegarLoop]: 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-28 15:01:29,128 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 70 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:29,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 69 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:29,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-28 15:01:29,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2022-04-28 15:01:29,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:29,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:29,167 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:29,168 INFO L87 Difference]: Start difference. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:29,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:29,175 INFO L93 Difference]: Finished difference Result 307 states and 440 transitions. [2022-04-28 15:01:29,175 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 440 transitions. [2022-04-28 15:01:29,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:29,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:29,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 307 states. [2022-04-28 15:01:29,177 INFO L87 Difference]: Start difference. First operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 307 states. [2022-04-28 15:01:29,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:29,187 INFO L93 Difference]: Finished difference Result 307 states and 440 transitions. [2022-04-28 15:01:29,187 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 440 transitions. [2022-04-28 15:01:29,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:29,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:29,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:29,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:29,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 439 transitions. [2022-04-28 15:01:29,196 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 439 transitions. Word has length 20 [2022-04-28 15:01:29,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:29,197 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 439 transitions. [2022-04-28 15:01:29,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:29,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 305 states and 439 transitions. [2022-04-28 15:01:29,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:29,639 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 439 transitions. [2022-04-28 15:01:29,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 15:01:29,640 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:29,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:29,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 15:01:29,640 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:29,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:29,640 INFO L85 PathProgramCache]: Analyzing trace with hash 984860303, now seen corresponding path program 1 times [2022-04-28 15:01:29,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:29,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1929143168] [2022-04-28 15:01:29,641 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:29,641 INFO L85 PathProgramCache]: Analyzing trace with hash 984860303, now seen corresponding path program 2 times [2022-04-28 15:01:29,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:29,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162284109] [2022-04-28 15:01:29,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:29,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:29,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:29,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {9440#(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(15, 2);call #Ultimate.allocInit(12, 3); {9434#true} is VALID [2022-04-28 15:01:29,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {9434#true} assume true; {9434#true} is VALID [2022-04-28 15:01:29,674 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9434#true} {9434#true} #132#return; {9434#true} is VALID [2022-04-28 15:01:29,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {9434#true} call ULTIMATE.init(); {9440#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:29,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {9440#(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(15, 2);call #Ultimate.allocInit(12, 3); {9434#true} is VALID [2022-04-28 15:01:29,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {9434#true} assume true; {9434#true} is VALID [2022-04-28 15:01:29,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9434#true} {9434#true} #132#return; {9434#true} is VALID [2022-04-28 15:01:29,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {9434#true} call #t~ret11 := main(); {9434#true} is VALID [2022-04-28 15:01:29,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {9434#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;havoc ~cond~0; {9434#true} is VALID [2022-04-28 15:01:29,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {9434#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {9434#true} is VALID [2022-04-28 15:01:29,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {9434#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {9434#true} is VALID [2022-04-28 15:01:29,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {9434#true} assume !(0 != ~p1~0); {9434#true} is VALID [2022-04-28 15:01:29,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {9434#true} assume !(0 != ~p2~0); {9434#true} is VALID [2022-04-28 15:01:29,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {9434#true} assume !(0 != ~p3~0); {9434#true} is VALID [2022-04-28 15:01:29,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {9434#true} assume 0 != ~p4~0;~lk4~0 := 1; {9439#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:29,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {9439#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {9439#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:29,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {9439#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {9439#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:29,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {9439#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {9439#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:29,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {9439#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {9439#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:29,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {9439#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {9439#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:29,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {9439#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {9435#false} is VALID [2022-04-28 15:01:29,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {9435#false} assume 0 != ~p5~0; {9435#false} is VALID [2022-04-28 15:01:29,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {9435#false} assume 1 != ~lk5~0; {9435#false} is VALID [2022-04-28 15:01:29,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {9435#false} assume !false; {9435#false} is VALID [2022-04-28 15:01:29,679 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-28 15:01:29,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:29,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162284109] [2022-04-28 15:01:29,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162284109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:29,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:29,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:29,680 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:29,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1929143168] [2022-04-28 15:01:29,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1929143168] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:29,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:29,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:29,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223045538] [2022-04-28 15:01:29,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:29,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 15:01:29,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:29,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:29,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:29,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:29,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:29,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:29,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:29,701 INFO L87 Difference]: Start difference. First operand 305 states and 439 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:29,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:29,826 INFO L93 Difference]: Finished difference Result 457 states and 653 transitions. [2022-04-28 15:01:29,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:29,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 15:01:29,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:29,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:29,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-28 15:01:29,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:29,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-28 15:01:29,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 106 transitions. [2022-04-28 15:01:29,903 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-28 15:01:29,910 INFO L225 Difference]: With dead ends: 457 [2022-04-28 15:01:29,910 INFO L226 Difference]: Without dead ends: 315 [2022-04-28 15:01:29,911 INFO L412 NwaCegarLoop]: 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-28 15:01:29,911 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:29,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 64 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:29,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-04-28 15:01:29,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2022-04-28 15:01:29,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:29,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 315 states. Second operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:29,936 INFO L74 IsIncluded]: Start isIncluded. First operand 315 states. Second operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:29,937 INFO L87 Difference]: Start difference. First operand 315 states. Second operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:29,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:29,946 INFO L93 Difference]: Finished difference Result 315 states and 440 transitions. [2022-04-28 15:01:29,947 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 440 transitions. [2022-04-28 15:01:29,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:29,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:29,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 315 states. [2022-04-28 15:01:29,949 INFO L87 Difference]: Start difference. First operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 315 states. [2022-04-28 15:01:29,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:29,956 INFO L93 Difference]: Finished difference Result 315 states and 440 transitions. [2022-04-28 15:01:29,956 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 440 transitions. [2022-04-28 15:01:29,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:29,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:29,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:29,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:29,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:29,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 439 transitions. [2022-04-28 15:01:29,966 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 439 transitions. Word has length 21 [2022-04-28 15:01:29,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:29,966 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 439 transitions. [2022-04-28 15:01:29,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:29,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 313 states and 439 transitions. [2022-04-28 15:01:30,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:30,393 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 439 transitions. [2022-04-28 15:01:30,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 15:01:30,394 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:30,394 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:30,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 15:01:30,394 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:30,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:30,395 INFO L85 PathProgramCache]: Analyzing trace with hash 591833293, now seen corresponding path program 1 times [2022-04-28 15:01:30,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:30,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1161708489] [2022-04-28 15:01:30,395 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:30,395 INFO L85 PathProgramCache]: Analyzing trace with hash 591833293, now seen corresponding path program 2 times [2022-04-28 15:01:30,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:30,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9608949] [2022-04-28 15:01:30,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:30,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:30,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:30,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {11622#(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(15, 2);call #Ultimate.allocInit(12, 3); {11616#true} is VALID [2022-04-28 15:01:30,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {11616#true} assume true; {11616#true} is VALID [2022-04-28 15:01:30,431 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11616#true} {11616#true} #132#return; {11616#true} is VALID [2022-04-28 15:01:30,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {11616#true} call ULTIMATE.init(); {11622#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:30,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {11622#(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(15, 2);call #Ultimate.allocInit(12, 3); {11616#true} is VALID [2022-04-28 15:01:30,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {11616#true} assume true; {11616#true} is VALID [2022-04-28 15:01:30,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11616#true} {11616#true} #132#return; {11616#true} is VALID [2022-04-28 15:01:30,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {11616#true} call #t~ret11 := main(); {11616#true} is VALID [2022-04-28 15:01:30,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {11616#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;havoc ~cond~0; {11616#true} is VALID [2022-04-28 15:01:30,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {11616#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {11616#true} is VALID [2022-04-28 15:01:30,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {11616#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {11616#true} is VALID [2022-04-28 15:01:30,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {11616#true} assume !(0 != ~p1~0); {11616#true} is VALID [2022-04-28 15:01:30,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {11616#true} assume !(0 != ~p2~0); {11616#true} is VALID [2022-04-28 15:01:30,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {11616#true} assume !(0 != ~p3~0); {11616#true} is VALID [2022-04-28 15:01:30,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {11616#true} assume !(0 != ~p4~0); {11616#true} is VALID [2022-04-28 15:01:30,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {11616#true} assume 0 != ~p5~0;~lk5~0 := 1; {11621#(= main_~lk5~0 1)} is VALID [2022-04-28 15:01:30,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {11621#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {11621#(= main_~lk5~0 1)} is VALID [2022-04-28 15:01:30,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {11621#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {11621#(= main_~lk5~0 1)} is VALID [2022-04-28 15:01:30,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {11621#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {11621#(= main_~lk5~0 1)} is VALID [2022-04-28 15:01:30,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {11621#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {11621#(= main_~lk5~0 1)} is VALID [2022-04-28 15:01:30,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {11621#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {11621#(= main_~lk5~0 1)} is VALID [2022-04-28 15:01:30,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {11621#(= main_~lk5~0 1)} assume 0 != ~p5~0; {11621#(= main_~lk5~0 1)} is VALID [2022-04-28 15:01:30,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {11621#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {11617#false} is VALID [2022-04-28 15:01:30,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {11617#false} assume !false; {11617#false} is VALID [2022-04-28 15:01:30,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-28 15:01:30,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:30,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9608949] [2022-04-28 15:01:30,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9608949] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:30,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:30,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:30,437 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:30,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1161708489] [2022-04-28 15:01:30,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1161708489] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:30,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:30,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:30,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672355104] [2022-04-28 15:01:30,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:30,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 15:01:30,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:30,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:30,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:30,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:30,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:30,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:30,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:30,451 INFO L87 Difference]: Start difference. First operand 313 states and 439 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:30,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:30,594 INFO L93 Difference]: Finished difference Result 525 states and 737 transitions. [2022-04-28 15:01:30,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:30,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 15:01:30,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:30,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:30,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-04-28 15:01:30,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:30,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-04-28 15:01:30,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2022-04-28 15:01:30,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:30,662 INFO L225 Difference]: With dead ends: 525 [2022-04-28 15:01:30,662 INFO L226 Difference]: Without dead ends: 523 [2022-04-28 15:01:30,663 INFO L412 NwaCegarLoop]: 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-28 15:01:30,664 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 72 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:30,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 50 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:30,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-04-28 15:01:30,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 457. [2022-04-28 15:01:30,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:30,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 523 states. Second operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:30,720 INFO L74 IsIncluded]: Start isIncluded. First operand 523 states. Second operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:30,721 INFO L87 Difference]: Start difference. First operand 523 states. Second operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:30,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:30,736 INFO L93 Difference]: Finished difference Result 523 states and 720 transitions. [2022-04-28 15:01:30,737 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 720 transitions. [2022-04-28 15:01:30,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:30,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:30,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 523 states. [2022-04-28 15:01:30,739 INFO L87 Difference]: Start difference. First operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 523 states. [2022-04-28 15:01:30,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:30,755 INFO L93 Difference]: Finished difference Result 523 states and 720 transitions. [2022-04-28 15:01:30,755 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 720 transitions. [2022-04-28 15:01:30,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:30,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:30,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:30,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:30,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 623 transitions. [2022-04-28 15:01:30,777 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 623 transitions. Word has length 21 [2022-04-28 15:01:30,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:30,777 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 623 transitions. [2022-04-28 15:01:30,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:30,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 457 states and 623 transitions. [2022-04-28 15:01:31,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 623 edges. 623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:31,397 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 623 transitions. [2022-04-28 15:01:31,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 15:01:31,397 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:31,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:31,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 15:01:31,398 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:31,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:31,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1271891663, now seen corresponding path program 1 times [2022-04-28 15:01:31,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:31,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1744948879] [2022-04-28 15:01:31,399 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:31,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1271891663, now seen corresponding path program 2 times [2022-04-28 15:01:31,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:31,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601378033] [2022-04-28 15:01:31,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:31,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:31,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:31,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {14644#(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(15, 2);call #Ultimate.allocInit(12, 3); {14638#true} is VALID [2022-04-28 15:01:31,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {14638#true} assume true; {14638#true} is VALID [2022-04-28 15:01:31,460 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14638#true} {14638#true} #132#return; {14638#true} is VALID [2022-04-28 15:01:31,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {14638#true} call ULTIMATE.init(); {14644#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:31,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {14644#(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(15, 2);call #Ultimate.allocInit(12, 3); {14638#true} is VALID [2022-04-28 15:01:31,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {14638#true} assume true; {14638#true} is VALID [2022-04-28 15:01:31,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14638#true} {14638#true} #132#return; {14638#true} is VALID [2022-04-28 15:01:31,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {14638#true} call #t~ret11 := main(); {14638#true} is VALID [2022-04-28 15:01:31,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {14638#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;havoc ~cond~0; {14638#true} is VALID [2022-04-28 15:01:31,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {14638#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {14638#true} is VALID [2022-04-28 15:01:31,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {14638#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {14638#true} is VALID [2022-04-28 15:01:31,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {14638#true} assume !(0 != ~p1~0); {14638#true} is VALID [2022-04-28 15:01:31,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {14638#true} assume !(0 != ~p2~0); {14638#true} is VALID [2022-04-28 15:01:31,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {14638#true} assume !(0 != ~p3~0); {14638#true} is VALID [2022-04-28 15:01:31,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {14638#true} assume !(0 != ~p4~0); {14638#true} is VALID [2022-04-28 15:01:31,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {14638#true} assume !(0 != ~p5~0); {14643#(= main_~p5~0 0)} is VALID [2022-04-28 15:01:31,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {14643#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {14643#(= main_~p5~0 0)} is VALID [2022-04-28 15:01:31,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {14643#(= main_~p5~0 0)} assume !(0 != ~p1~0); {14643#(= main_~p5~0 0)} is VALID [2022-04-28 15:01:31,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {14643#(= main_~p5~0 0)} assume !(0 != ~p2~0); {14643#(= main_~p5~0 0)} is VALID [2022-04-28 15:01:31,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {14643#(= main_~p5~0 0)} assume !(0 != ~p3~0); {14643#(= main_~p5~0 0)} is VALID [2022-04-28 15:01:31,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {14643#(= main_~p5~0 0)} assume !(0 != ~p4~0); {14643#(= main_~p5~0 0)} is VALID [2022-04-28 15:01:31,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {14643#(= main_~p5~0 0)} assume 0 != ~p5~0; {14639#false} is VALID [2022-04-28 15:01:31,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {14639#false} assume 1 != ~lk5~0; {14639#false} is VALID [2022-04-28 15:01:31,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {14639#false} assume !false; {14639#false} is VALID [2022-04-28 15:01:31,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:01:31,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:31,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601378033] [2022-04-28 15:01:31,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601378033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:31,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:31,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:31,467 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:31,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1744948879] [2022-04-28 15:01:31,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1744948879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:31,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:31,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:31,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670320256] [2022-04-28 15:01:31,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:31,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 15:01:31,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:31,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:31,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:31,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:31,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:31,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:31,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:31,482 INFO L87 Difference]: Start difference. First operand 457 states and 623 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:31,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:31,708 INFO L93 Difference]: Finished difference Result 1021 states and 1377 transitions. [2022-04-28 15:01:31,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:31,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 15:01:31,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:31,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:31,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-28 15:01:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-28 15:01:31,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-28 15:01:31,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:31,816 INFO L225 Difference]: With dead ends: 1021 [2022-04-28 15:01:31,816 INFO L226 Difference]: Without dead ends: 587 [2022-04-28 15:01:31,817 INFO L412 NwaCegarLoop]: 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-28 15:01:31,818 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:31,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 71 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:31,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-04-28 15:01:31,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2022-04-28 15:01:31,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:31,862 INFO L82 GeneralOperation]: Start isEquivalent. First operand 587 states. Second operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:31,863 INFO L74 IsIncluded]: Start isIncluded. First operand 587 states. Second operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:31,864 INFO L87 Difference]: Start difference. First operand 587 states. Second operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:31,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:31,882 INFO L93 Difference]: Finished difference Result 587 states and 760 transitions. [2022-04-28 15:01:31,882 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 760 transitions. [2022-04-28 15:01:31,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:31,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:31,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 587 states. [2022-04-28 15:01:31,886 INFO L87 Difference]: Start difference. First operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 587 states. [2022-04-28 15:01:31,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:31,905 INFO L93 Difference]: Finished difference Result 587 states and 760 transitions. [2022-04-28 15:01:31,905 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 760 transitions. [2022-04-28 15:01:31,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:31,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:31,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:31,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:31,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:31,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 759 transitions. [2022-04-28 15:01:31,931 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 759 transitions. Word has length 21 [2022-04-28 15:01:31,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:31,932 INFO L495 AbstractCegarLoop]: Abstraction has 585 states and 759 transitions. [2022-04-28 15:01:31,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:31,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 585 states and 759 transitions. [2022-04-28 15:01:32,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 759 edges. 759 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:32,768 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 759 transitions. [2022-04-28 15:01:32,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 15:01:32,769 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:32,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:32,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 15:01:32,770 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:32,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:32,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1167178942, now seen corresponding path program 1 times [2022-04-28 15:01:32,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:32,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [953286093] [2022-04-28 15:01:32,771 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:32,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1167178942, now seen corresponding path program 2 times [2022-04-28 15:01:32,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:32,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847447928] [2022-04-28 15:01:32,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:32,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:32,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:32,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {19042#(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(15, 2);call #Ultimate.allocInit(12, 3); {19036#true} is VALID [2022-04-28 15:01:32,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {19036#true} assume true; {19036#true} is VALID [2022-04-28 15:01:32,807 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19036#true} {19036#true} #132#return; {19036#true} is VALID [2022-04-28 15:01:32,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {19036#true} call ULTIMATE.init(); {19042#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:32,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {19042#(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(15, 2);call #Ultimate.allocInit(12, 3); {19036#true} is VALID [2022-04-28 15:01:32,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {19036#true} assume true; {19036#true} is VALID [2022-04-28 15:01:32,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19036#true} {19036#true} #132#return; {19036#true} is VALID [2022-04-28 15:01:32,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {19036#true} call #t~ret11 := main(); {19036#true} is VALID [2022-04-28 15:01:32,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {19036#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;havoc ~cond~0; {19036#true} is VALID [2022-04-28 15:01:32,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {19036#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {19036#true} is VALID [2022-04-28 15:01:32,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {19036#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {19036#true} is VALID [2022-04-28 15:01:32,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {19036#true} assume !(0 != ~p1~0); {19036#true} is VALID [2022-04-28 15:01:32,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {19036#true} assume !(0 != ~p2~0); {19036#true} is VALID [2022-04-28 15:01:32,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {19036#true} assume !(0 != ~p3~0); {19036#true} is VALID [2022-04-28 15:01:32,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {19036#true} assume !(0 != ~p4~0); {19036#true} is VALID [2022-04-28 15:01:32,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {19036#true} assume 0 != ~p5~0;~lk5~0 := 1; {19041#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:01:32,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {19041#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {19041#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:01:32,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {19041#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {19041#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:01:32,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {19041#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {19041#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:01:32,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {19041#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {19041#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:01:32,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {19041#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {19041#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:01:32,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {19041#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {19037#false} is VALID [2022-04-28 15:01:32,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {19037#false} assume 0 != ~p6~0; {19037#false} is VALID [2022-04-28 15:01:32,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {19037#false} assume 1 != ~lk6~0; {19037#false} is VALID [2022-04-28 15:01:32,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {19037#false} assume !false; {19037#false} is VALID [2022-04-28 15:01:32,812 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-28 15:01:32,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:32,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847447928] [2022-04-28 15:01:32,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847447928] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:32,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:32,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:32,813 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:32,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [953286093] [2022-04-28 15:01:32,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [953286093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:32,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:32,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:32,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032303121] [2022-04-28 15:01:32,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:32,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 15:01:32,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:32,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:32,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:32,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:32,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:32,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:32,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:32,830 INFO L87 Difference]: Start difference. First operand 585 states and 759 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:33,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:33,026 INFO L93 Difference]: Finished difference Result 877 states and 1129 transitions. [2022-04-28 15:01:33,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:33,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 15:01:33,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:33,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:33,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-28 15:01:33,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:33,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-28 15:01:33,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-28 15:01:33,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:33,134 INFO L225 Difference]: With dead ends: 877 [2022-04-28 15:01:33,134 INFO L226 Difference]: Without dead ends: 603 [2022-04-28 15:01:33,135 INFO L412 NwaCegarLoop]: 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-28 15:01:33,135 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 75 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:33,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 61 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:33,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-04-28 15:01:33,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2022-04-28 15:01:33,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:33,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:33,206 INFO L74 IsIncluded]: Start isIncluded. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:33,207 INFO L87 Difference]: Start difference. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:33,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:33,226 INFO L93 Difference]: Finished difference Result 603 states and 760 transitions. [2022-04-28 15:01:33,226 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 760 transitions. [2022-04-28 15:01:33,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:33,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:33,228 INFO L74 IsIncluded]: Start isIncluded. First operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states 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-28 15:01:33,229 INFO L87 Difference]: Start difference. First operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states 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-28 15:01:33,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:33,247 INFO L93 Difference]: Finished difference Result 603 states and 760 transitions. [2022-04-28 15:01:33,247 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 760 transitions. [2022-04-28 15:01:33,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:33,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:33,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:33,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:33,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:33,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 759 transitions. [2022-04-28 15:01:33,273 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 759 transitions. Word has length 22 [2022-04-28 15:01:33,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:33,274 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 759 transitions. [2022-04-28 15:01:33,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:33,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 601 states and 759 transitions. [2022-04-28 15:01:33,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 759 edges. 759 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:33,985 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 759 transitions. [2022-04-28 15:01:33,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 15:01:33,986 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:33,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:33,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 15:01:33,986 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:33,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:33,987 INFO L85 PathProgramCache]: Analyzing trace with hash 774151932, now seen corresponding path program 1 times [2022-04-28 15:01:33,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:33,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [348676676] [2022-04-28 15:01:33,987 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:33,987 INFO L85 PathProgramCache]: Analyzing trace with hash 774151932, now seen corresponding path program 2 times [2022-04-28 15:01:33,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:33,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533763066] [2022-04-28 15:01:33,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:33,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:34,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:34,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {23216#(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(15, 2);call #Ultimate.allocInit(12, 3); {23210#true} is VALID [2022-04-28 15:01:34,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {23210#true} assume true; {23210#true} is VALID [2022-04-28 15:01:34,027 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23210#true} {23210#true} #132#return; {23210#true} is VALID [2022-04-28 15:01:34,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {23210#true} call ULTIMATE.init(); {23216#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:34,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {23216#(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(15, 2);call #Ultimate.allocInit(12, 3); {23210#true} is VALID [2022-04-28 15:01:34,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {23210#true} assume true; {23210#true} is VALID [2022-04-28 15:01:34,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23210#true} {23210#true} #132#return; {23210#true} is VALID [2022-04-28 15:01:34,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {23210#true} call #t~ret11 := main(); {23210#true} is VALID [2022-04-28 15:01:34,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {23210#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;havoc ~cond~0; {23210#true} is VALID [2022-04-28 15:01:34,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {23210#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {23210#true} is VALID [2022-04-28 15:01:34,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {23210#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {23210#true} is VALID [2022-04-28 15:01:34,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {23210#true} assume !(0 != ~p1~0); {23210#true} is VALID [2022-04-28 15:01:34,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {23210#true} assume !(0 != ~p2~0); {23210#true} is VALID [2022-04-28 15:01:34,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {23210#true} assume !(0 != ~p3~0); {23210#true} is VALID [2022-04-28 15:01:34,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {23210#true} assume !(0 != ~p4~0); {23210#true} is VALID [2022-04-28 15:01:34,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {23210#true} assume !(0 != ~p5~0); {23210#true} is VALID [2022-04-28 15:01:34,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {23210#true} assume 0 != ~p6~0;~lk6~0 := 1; {23215#(= main_~lk6~0 1)} is VALID [2022-04-28 15:01:34,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {23215#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {23215#(= main_~lk6~0 1)} is VALID [2022-04-28 15:01:34,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {23215#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {23215#(= main_~lk6~0 1)} is VALID [2022-04-28 15:01:34,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {23215#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {23215#(= main_~lk6~0 1)} is VALID [2022-04-28 15:01:34,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {23215#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {23215#(= main_~lk6~0 1)} is VALID [2022-04-28 15:01:34,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {23215#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {23215#(= main_~lk6~0 1)} is VALID [2022-04-28 15:01:34,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {23215#(= main_~lk6~0 1)} assume 0 != ~p6~0; {23215#(= main_~lk6~0 1)} is VALID [2022-04-28 15:01:34,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {23215#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {23211#false} is VALID [2022-04-28 15:01:34,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {23211#false} assume !false; {23211#false} is VALID [2022-04-28 15:01:34,032 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-28 15:01:34,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:34,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533763066] [2022-04-28 15:01:34,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533763066] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:34,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:34,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:34,033 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:34,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [348676676] [2022-04-28 15:01:34,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [348676676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:34,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:34,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:34,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534479365] [2022-04-28 15:01:34,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:34,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 15:01:34,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:34,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:34,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:34,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:34,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:34,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:34,048 INFO L87 Difference]: Start difference. First operand 601 states and 759 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:34,298 INFO L93 Difference]: Finished difference Result 971 states and 1208 transitions. [2022-04-28 15:01:34,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:34,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 15:01:34,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:34,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-04-28 15:01:34,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-04-28 15:01:34,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 62 transitions. [2022-04-28 15:01:34,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:34,416 INFO L225 Difference]: With dead ends: 971 [2022-04-28 15:01:34,416 INFO L226 Difference]: Without dead ends: 969 [2022-04-28 15:01:34,417 INFO L412 NwaCegarLoop]: 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-28 15:01:34,417 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:34,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 48 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:34,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2022-04-28 15:01:34,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 905. [2022-04-28 15:01:34,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:34,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 969 states. Second operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,496 INFO L74 IsIncluded]: Start isIncluded. First operand 969 states. Second operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,497 INFO L87 Difference]: Start difference. First operand 969 states. Second operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:34,542 INFO L93 Difference]: Finished difference Result 969 states and 1175 transitions. [2022-04-28 15:01:34,542 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1175 transitions. [2022-04-28 15:01:34,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:34,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:34,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 969 states. [2022-04-28 15:01:34,548 INFO L87 Difference]: Start difference. First operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 969 states. [2022-04-28 15:01:34,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:34,592 INFO L93 Difference]: Finished difference Result 969 states and 1175 transitions. [2022-04-28 15:01:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1175 transitions. [2022-04-28 15:01:34,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:34,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:34,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:34,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:34,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1111 transitions. [2022-04-28 15:01:34,672 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1111 transitions. Word has length 22 [2022-04-28 15:01:34,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:34,672 INFO L495 AbstractCegarLoop]: Abstraction has 905 states and 1111 transitions. [2022-04-28 15:01:34,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 905 states and 1111 transitions. [2022-04-28 15:01:35,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1111 edges. 1111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:35,743 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1111 transitions. [2022-04-28 15:01:35,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 15:01:35,744 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:35,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:35,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 15:01:35,745 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:35,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:35,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1454210302, now seen corresponding path program 1 times [2022-04-28 15:01:35,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:35,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [370612745] [2022-04-28 15:01:35,746 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:35,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1454210302, now seen corresponding path program 2 times [2022-04-28 15:01:35,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:35,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759636080] [2022-04-28 15:01:35,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:35,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:35,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:35,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {28918#(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(15, 2);call #Ultimate.allocInit(12, 3); {28912#true} is VALID [2022-04-28 15:01:35,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {28912#true} assume true; {28912#true} is VALID [2022-04-28 15:01:35,794 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28912#true} {28912#true} #132#return; {28912#true} is VALID [2022-04-28 15:01:35,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {28912#true} call ULTIMATE.init(); {28918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:35,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {28918#(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(15, 2);call #Ultimate.allocInit(12, 3); {28912#true} is VALID [2022-04-28 15:01:35,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {28912#true} assume true; {28912#true} is VALID [2022-04-28 15:01:35,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28912#true} {28912#true} #132#return; {28912#true} is VALID [2022-04-28 15:01:35,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {28912#true} call #t~ret11 := main(); {28912#true} is VALID [2022-04-28 15:01:35,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {28912#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;havoc ~cond~0; {28912#true} is VALID [2022-04-28 15:01:35,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {28912#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {28912#true} is VALID [2022-04-28 15:01:35,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {28912#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {28912#true} is VALID [2022-04-28 15:01:35,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {28912#true} assume !(0 != ~p1~0); {28912#true} is VALID [2022-04-28 15:01:35,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {28912#true} assume !(0 != ~p2~0); {28912#true} is VALID [2022-04-28 15:01:35,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {28912#true} assume !(0 != ~p3~0); {28912#true} is VALID [2022-04-28 15:01:35,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {28912#true} assume !(0 != ~p4~0); {28912#true} is VALID [2022-04-28 15:01:35,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {28912#true} assume !(0 != ~p5~0); {28912#true} is VALID [2022-04-28 15:01:35,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {28912#true} assume !(0 != ~p6~0); {28917#(= main_~p6~0 0)} is VALID [2022-04-28 15:01:35,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {28917#(= main_~p6~0 0)} assume !(0 != ~p1~0); {28917#(= main_~p6~0 0)} is VALID [2022-04-28 15:01:35,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {28917#(= main_~p6~0 0)} assume !(0 != ~p2~0); {28917#(= main_~p6~0 0)} is VALID [2022-04-28 15:01:35,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {28917#(= main_~p6~0 0)} assume !(0 != ~p3~0); {28917#(= main_~p6~0 0)} is VALID [2022-04-28 15:01:35,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {28917#(= main_~p6~0 0)} assume !(0 != ~p4~0); {28917#(= main_~p6~0 0)} is VALID [2022-04-28 15:01:35,800 INFO L290 TraceCheckUtils]: 18: Hoare triple {28917#(= main_~p6~0 0)} assume !(0 != ~p5~0); {28917#(= main_~p6~0 0)} is VALID [2022-04-28 15:01:35,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {28917#(= main_~p6~0 0)} assume 0 != ~p6~0; {28913#false} is VALID [2022-04-28 15:01:35,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {28913#false} assume 1 != ~lk6~0; {28913#false} is VALID [2022-04-28 15:01:35,801 INFO L290 TraceCheckUtils]: 21: Hoare triple {28913#false} assume !false; {28913#false} is VALID [2022-04-28 15:01:35,801 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-28 15:01:35,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:35,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759636080] [2022-04-28 15:01:35,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759636080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:35,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:35,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:35,804 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:35,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [370612745] [2022-04-28 15:01:35,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [370612745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:35,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:35,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:35,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719275682] [2022-04-28 15:01:35,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:35,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 15:01:35,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:35,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:35,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:35,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:35,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:35,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:35,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:35,819 INFO L87 Difference]: Start difference. First operand 905 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:36,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:36,284 INFO L93 Difference]: Finished difference Result 1993 states and 2391 transitions. [2022-04-28 15:01:36,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:36,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 15:01:36,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:36,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:36,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-28 15:01:36,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:36,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-28 15:01:36,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-28 15:01:36,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:36,366 INFO L225 Difference]: With dead ends: 1993 [2022-04-28 15:01:36,367 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 15:01:36,370 INFO L412 NwaCegarLoop]: 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-28 15:01:36,370 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:36,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 72 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:36,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 15:01:36,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 15:01:36,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:36,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 15:01:36,372 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 15:01:36,372 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 15:01:36,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:36,372 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 15:01:36,372 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 15:01:36,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:36,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:36,372 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 15:01:36,372 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 15:01:36,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:36,373 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 15:01:36,373 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 15:01:36,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:36,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:36,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:36,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:36,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 15:01:36,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 15:01:36,373 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-04-28 15:01:36,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:36,373 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 15:01:36,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:36,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 15:01:36,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:36,374 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 15:01:36,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:36,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 15:01:36,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 15:01:36,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 15:01:45,862 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 15:01:45,862 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 15:01:45,862 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 15:01:45,862 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 15:01:45,862 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 15:01:45,862 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 15:01:45,862 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 15:01:45,863 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 15:01:45,863 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 15:01:45,863 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 15:01:45,863 INFO L895 garLoopResultBuilder]: At program point L60-1(lines 29 104) the Hoare annotation is: (let ((.cse5 (= main_~lk1~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse3 (= main_~p2~0 0)) (.cse4 (= main_~p4~0 0)) (.cse2 (= main_~p1~0 0)) (.cse6 (= main_~p3~0 0)) (.cse7 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse7) (and .cse4 .cse2 .cse3 .cse6) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse5 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse6 .cse7) (and .cse5 .cse0 .cse1 .cse7) (and .cse4 .cse1 .cse2 .cse7) (and .cse0 .cse1 .cse2 .cse7) (and .cse4 .cse5 .cse3 .cse6) (and .cse0 .cse2 .cse6 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse0 .cse1 .cse3) (and .cse4 .cse2 .cse6 .cse7))) [2022-04-28 15:01:45,863 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 6 109) the Hoare annotation is: true [2022-04-28 15:01:45,863 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (let ((.cse1 (= main_~p4~0 0)) (.cse2 (= main_~lk5~0 1)) (.cse5 (= main_~lk6~0 1)) (.cse0 (not (= main_~p3~0 0))) (.cse7 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse6 (= main_~p5~0 0)) (.cse4 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse6 .cse5) (and .cse0 .cse2 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse7 .cse3 .cse4) (and .cse0 .cse7 .cse3 .cse6 .cse5) (and .cse0 .cse7 .cse3 .cse6 .cse4))) [2022-04-28 15:01:45,863 INFO L895 garLoopResultBuilder]: At program point L52-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~p2~0 0)) (.cse2 (= main_~p1~0 0)) (.cse1 (= main_~lk2~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-04-28 15:01:45,863 INFO L895 garLoopResultBuilder]: At program point L94-1(lines 29 104) the Hoare annotation is: (or (= main_~p6~0 0) (= main_~lk6~0 1)) [2022-04-28 15:01:45,863 INFO L895 garLoopResultBuilder]: At program point L95(line 95) the Hoare annotation is: (let ((.cse0 (not (= main_~p5~0 0))) (.cse1 (= main_~lk5~0 1))) (or (and .cse0 .cse1 (= main_~p6~0 0)) (and .cse0 .cse1 (= main_~lk6~0 1)))) [2022-04-28 15:01:45,864 INFO L895 garLoopResultBuilder]: At program point L79-1(lines 29 104) the Hoare annotation is: (let ((.cse1 (= main_~p5~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse0 (= main_~p4~0 0)) (.cse6 (= main_~lk3~0 1)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~lk4~0 1)) (.cse7 (= main_~p6~0 0)) (.cse3 (= main_~p3~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse6 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse7 .cse3) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse6 .cse1 .cse2) (and .cse5 .cse6 .cse1 .cse2) (and .cse4 .cse5 .cse2 .cse3) (and .cse5 .cse6 .cse1 .cse7) (and .cse0 .cse4 .cse6 .cse2) (and .cse5 .cse1 .cse7 .cse3) (and .cse0 .cse4 .cse7 .cse3) (and .cse4 .cse5 .cse6 .cse2) (and .cse0 .cse4 .cse6 .cse7) (and .cse4 .cse5 .cse7 .cse3))) [2022-04-28 15:01:45,864 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 6 109) the Hoare annotation is: true [2022-04-28 15:01:45,864 INFO L895 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 107) the Hoare annotation is: false [2022-04-28 15:01:45,864 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 6 109) the Hoare annotation is: true [2022-04-28 15:01:45,864 INFO L895 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (let ((.cse0 (= main_~p4~0 0)) (.cse1 (= main_~p5~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse3 (= main_~p3~0 0)) (.cse6 (= main_~lk5~0 1)) (.cse7 (= main_~lk4~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse5 (= main_~p6~0 0)) (.cse4 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse5 .cse3 .cse4) (and .cse6 .cse7 .cse8 .cse2 .cse4) (and .cse6 .cse7 .cse5 .cse3 .cse4) (and .cse7 .cse8 .cse1 .cse2 .cse4) (and .cse0 .cse8 .cse1 .cse2 .cse4) (and .cse7 .cse1 .cse5 .cse3 .cse4) (and .cse6 .cse7 .cse2 .cse3 .cse4) (and .cse0 .cse6 .cse8 .cse2 .cse4) (and .cse7 .cse8 .cse1 .cse5 .cse4) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse0 .cse6 .cse8 .cse5 .cse4) (and .cse0 .cse8 .cse1 .cse5 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse8 .cse5 .cse4))) [2022-04-28 15:01:45,864 INFO L902 garLoopResultBuilder]: At program point L105(lines 7 109) the Hoare annotation is: true [2022-04-28 15:01:45,864 INFO L902 garLoopResultBuilder]: At program point L31(lines 31 33) the Hoare annotation is: true [2022-04-28 15:01:45,865 INFO L895 garLoopResultBuilder]: At program point L64-1(lines 29 104) the Hoare annotation is: (let ((.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~p3~0 0)) (.cse5 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse8 (= main_~p1~0 0)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse2 .cse8 .cse7 .cse4 .cse9) (and .cse0 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse0 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse9) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse5 .cse6 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse3) (and .cse5 .cse0 .cse6 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse7 .cse4 .cse9) (and .cse5 .cse0 .cse6 .cse8 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse3) (and .cse5 .cse0 .cse8 .cse3 .cse4) (and .cse5 .cse1 .cse7 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse3 .cse4) (and .cse2 .cse6 .cse8 .cse7 .cse9) (and .cse5 .cse0 .cse1 .cse4 .cse9) (and .cse2 .cse8 .cse7 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse2 .cse8 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse4 .cse9) (and .cse5 .cse6 .cse8 .cse7 .cse3) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse3) (and .cse2 .cse6 .cse8 .cse7 .cse3))) [2022-04-28 15:01:45,865 INFO L895 garLoopResultBuilder]: At program point L89-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~lk5~0 1)) (.cse3 (= main_~lk6~0 1)) (.cse2 (= main_~p5~0 0)) (.cse1 (= main_~p6~0 0))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-04-28 15:01:45,865 INFO L895 garLoopResultBuilder]: At program point L56-1(lines 29 104) the Hoare annotation is: (let ((.cse4 (= main_~p1~0 0)) (.cse2 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse1 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse4 .cse1) (and .cse0 .cse2 .cse5) (and .cse4 .cse2 .cse5) (and .cse0 .cse3 .cse1))) [2022-04-28 15:01:45,865 INFO L902 garLoopResultBuilder]: At program point L48(lines 48 50) the Hoare annotation is: true [2022-04-28 15:01:45,865 INFO L895 garLoopResultBuilder]: At program point L48-2(lines 29 104) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-04-28 15:01:45,866 INFO L895 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (let ((.cse3 (= main_~p6~0 0)) (.cse4 (= main_~p5~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (not (= main_~p4~0 0))) (.cse2 (= main_~lk4~0 1)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse3) (and .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse5))) [2022-04-28 15:01:45,866 INFO L895 garLoopResultBuilder]: At program point L74-1(lines 29 104) the Hoare annotation is: (let ((.cse8 (= main_~p4~0 0)) (.cse2 (= main_~p2~0 0)) (.cse6 (= main_~p5~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse4 (= main_~p3~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse5 (= main_~lk3~0 1)) (.cse7 (= main_~p6~0 0)) (.cse9 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse6 .cse2 .cse7) (and .cse0 .cse1 .cse5 .cse2 .cse7) (and .cse8 .cse5 .cse6 .cse2 .cse7) (and .cse8 .cse6 .cse3 .cse4 .cse9) (and .cse8 .cse5 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7 .cse4) (and .cse8 .cse6 .cse7 .cse4 .cse9) (and .cse8 .cse0 .cse7 .cse4 .cse9) (and .cse0 .cse1 .cse5 .cse3 .cse9) (and .cse8 .cse6 .cse2 .cse7 .cse4) (and .cse0 .cse1 .cse7 .cse4 .cse9) (and .cse1 .cse5 .cse6 .cse3 .cse9) (and .cse8 .cse5 .cse6 .cse3 .cse9) (and .cse1 .cse6 .cse2 .cse7 .cse4) (and .cse1 .cse6 .cse7 .cse4 .cse9) (and .cse8 .cse6 .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse4 .cse9) (and .cse8 .cse0 .cse5 .cse3 .cse9) (and .cse1 .cse5 .cse6 .cse7 .cse9) (and .cse8 .cse0 .cse5 .cse2 .cse7) (and .cse8 .cse0 .cse3 .cse4 .cse9) (and .cse1 .cse6 .cse2 .cse3 .cse4) (and .cse8 .cse0 .cse2 .cse7 .cse4) (and .cse0 .cse1 .cse5 .cse2 .cse3) (and .cse8 .cse0 .cse5 .cse7 .cse9) (and .cse8 .cse0 .cse2 .cse3 .cse4) (and .cse8 .cse5 .cse6 .cse7 .cse9) (and .cse8 .cse0 .cse5 .cse2 .cse3) (and .cse1 .cse6 .cse3 .cse4 .cse9) (and .cse0 .cse1 .cse5 .cse7 .cse9))) [2022-04-28 15:01:45,866 INFO L902 garLoopResultBuilder]: At program point L99-1(lines 29 104) the Hoare annotation is: true [2022-04-28 15:01:45,866 INFO L895 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (let ((.cse8 (= main_~p5~0 0)) (.cse7 (= main_~lk4~0 1)) (.cse10 (= main_~p2~0 0)) (.cse4 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse0 (= main_~p4~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse2 (not (= main_~p1~0 0))) (.cse3 (= main_~lk1~0 1)) (.cse11 (= main_~lk3~0 1)) (.cse9 (= main_~lk6~0 1)) (.cse6 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse7 .cse8 .cse9 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse9 .cse5) (and .cse2 .cse3 .cse7 .cse8 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse4 .cse6) (and .cse2 .cse3 .cse7 .cse8 .cse10 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse4 .cse5) (and .cse2 .cse3 .cse7 .cse8 .cse10 .cse9 .cse5) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse9 .cse6) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse10 .cse4) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse4 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse10 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse4 .cse6) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse10 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse9 .cse5) (and .cse1 .cse2 .cse3 .cse7 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse10 .cse9) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse9 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse9 .cse5) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse10 .cse4) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse10 .cse9) (and .cse0 .cse2 .cse3 .cse8 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse9 .cse6) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse10 .cse9) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse10 .cse9) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse9 .cse6))) [2022-04-28 15:01:45,866 INFO L895 garLoopResultBuilder]: At program point L100(line 100) the Hoare annotation is: (= main_~lk6~0 1) [2022-04-28 15:01:45,866 INFO L895 garLoopResultBuilder]: At program point L100-1(lines 7 109) the Hoare annotation is: false [2022-04-28 15:01:45,866 INFO L895 garLoopResultBuilder]: At program point L84-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~p4~0 0)) (.cse4 (= main_~p5~0 0)) (.cse2 (= main_~p6~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse5 (= main_~lk4~0 1)) (.cse3 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and .cse0 .cse4 .cse2) (and .cse5 .cse4 .cse3) (and .cse0 .cse4 .cse3) (and .cse1 .cse5 .cse2) (and .cse5 .cse4 .cse2) (and .cse1 .cse5 .cse3))) [2022-04-28 15:01:45,867 INFO L895 garLoopResultBuilder]: At program point L68-1(lines 29 104) the Hoare annotation is: (let ((.cse3 (= main_~p2~0 0)) (.cse7 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse9 (= main_~p1~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse11 (= main_~p5~0 0)) (.cse6 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse10 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse6 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse6 .cse10) (and .cse0 .cse2 .cse9 .cse4 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse4 .cse10) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse4 .cse10) (and .cse7 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse4 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse2 .cse9 .cse6 .cse5 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse6 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse6 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse7 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse6) (and .cse7 .cse0 .cse9 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse6 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse6 .cse5 .cse10) (and .cse2 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse2 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse9 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse6 .cse10) (and .cse1 .cse2 .cse11 .cse6 .cse5 .cse10))) [2022-04-28 15:01:45,877 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 15:01:45,878 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 15:01:45,881 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 15:01:45,881 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 15:01:45,914 INFO L163 areAnnotationChecker]: CFG has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 15:01:45,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 03:01:45 BoogieIcfgContainer [2022-04-28 15:01:45,920 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 15:01:45,921 INFO L158 Benchmark]: Toolchain (without parser) took 23016.18ms. Allocated memory was 172.0MB in the beginning and 431.0MB in the end (delta: 259.0MB). Free memory was 120.2MB in the beginning and 370.2MB in the end (delta: -250.0MB). Peak memory consumption was 235.3MB. Max. memory is 8.0GB. [2022-04-28 15:01:45,921 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 172.0MB. Free memory was 137.0MB in the beginning and 136.8MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 15:01:45,922 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.58ms. Allocated memory was 172.0MB in the beginning and 206.6MB in the end (delta: 34.6MB). Free memory was 120.0MB in the beginning and 183.1MB in the end (delta: -63.1MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. [2022-04-28 15:01:45,922 INFO L158 Benchmark]: Boogie Preprocessor took 28.33ms. Allocated memory is still 206.6MB. Free memory was 183.1MB in the beginning and 181.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 15:01:45,922 INFO L158 Benchmark]: RCFGBuilder took 287.64ms. Allocated memory is still 206.6MB. Free memory was 181.0MB in the beginning and 168.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 15:01:45,922 INFO L158 Benchmark]: TraceAbstraction took 22448.45ms. Allocated memory was 206.6MB in the beginning and 431.0MB in the end (delta: 224.4MB). Free memory was 167.9MB in the beginning and 370.2MB in the end (delta: -202.4MB). Peak memory consumption was 248.0MB. Max. memory is 8.0GB. [2022-04-28 15:01:45,923 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 172.0MB. Free memory was 137.0MB in the beginning and 136.8MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 246.58ms. Allocated memory was 172.0MB in the beginning and 206.6MB in the end (delta: 34.6MB). Free memory was 120.0MB in the beginning and 183.1MB in the end (delta: -63.1MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.33ms. Allocated memory is still 206.6MB. Free memory was 183.1MB in the beginning and 181.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 287.64ms. Allocated memory is still 206.6MB. Free memory was 181.0MB in the beginning and 168.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 22448.45ms. Allocated memory was 206.6MB in the beginning and 431.0MB in the end (delta: 224.4MB). Free memory was 167.9MB in the beginning and 370.2MB in the end (delta: -202.4MB). Peak memory consumption was 248.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 107]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.4s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1224 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1224 mSDsluCounter, 1008 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 614 IncrementalHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 894 mSDtfsCounter, 614 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=905occurred in iteration=15, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 268 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 1162 NumberOfFragments, 4131 HoareAnnotationTreeSize, 33 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 3.5s HoareSimplificationTime, 33 FomulaSimplificationsInter, 38507 FormulaSimplificationTreeSizeReductionInter, 5.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 15:01:45,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...