/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_14-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:09:44,079 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:09:44,081 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:09:44,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:09:44,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:09:44,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:09:44,167 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:09:44,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:09:44,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:09:44,171 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:09:44,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:09:44,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:09:44,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:09:44,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:09:44,179 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:09:44,182 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:09:44,183 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:09:44,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:09:44,184 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:09:44,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:09:44,186 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:09:44,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:09:44,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:09:44,190 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:09:44,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:09:44,199 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:09:44,199 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:09:44,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:09:44,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:09:44,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:09:44,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:09:44,201 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:09:44,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:09:44,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:09:44,203 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:09:44,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:09:44,204 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:09:44,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:09:44,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:09:44,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:09:44,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:09:44,208 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:09:44,208 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 15:09:44,237 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:09:44,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:09:44,238 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 15:09:44,238 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 15:09:44,239 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 15:09:44,239 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 15:09:44,239 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 15:09:44,239 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 15:09:44,240 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 15:09:44,240 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:09:44,240 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:09:44,241 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:09:44,241 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:09:44,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:09:44,241 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:09:44,241 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:09:44,241 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:09:44,242 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:09:44,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:09:44,243 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:09:44,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:09:44,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:09:44,243 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:09:44,243 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:09:44,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:09:44,244 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:09:44,244 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 15:09:44,244 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 15:09:44,244 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:09:44,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 15:09:44,244 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 15:09:44,244 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 15:09:44,244 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 15:09:44,245 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 15:09:44,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:09:44,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:09:44,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:09:44,459 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:09:44,460 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:09:44,461 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14-2.c [2022-04-27 15:09:44,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7caeea702/3f6417f3ab45451fb1abd6109841b95b/FLAG12b2b489f [2022-04-27 15:09:44,877 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:09:44,878 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-2.c [2022-04-27 15:09:44,882 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7caeea702/3f6417f3ab45451fb1abd6109841b95b/FLAG12b2b489f [2022-04-27 15:09:44,892 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7caeea702/3f6417f3ab45451fb1abd6109841b95b [2022-04-27 15:09:44,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:09:44,894 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 15:09:44,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:09:44,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:09:44,898 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:09:44,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:09:44" (1/1) ... [2022-04-27 15:09:44,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d3eacea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:44, skipping insertion in model container [2022-04-27 15:09:44,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:09:44" (1/1) ... [2022-04-27 15:09:44,903 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:09:44,926 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:09:45,101 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-2.c[5305,5318] [2022-04-27 15:09:45,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:09:45,108 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:09:45,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-2.c[5305,5318] [2022-04-27 15:09:45,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:09:45,135 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:09:45,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:45 WrapperNode [2022-04-27 15:09:45,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:09:45,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:09:45,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:09:45,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:09:45,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:45" (1/1) ... [2022-04-27 15:09:45,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:45" (1/1) ... [2022-04-27 15:09:45,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:45" (1/1) ... [2022-04-27 15:09:45,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:45" (1/1) ... [2022-04-27 15:09:45,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:45" (1/1) ... [2022-04-27 15:09:45,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:45" (1/1) ... [2022-04-27 15:09:45,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:45" (1/1) ... [2022-04-27 15:09:45,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:09:45,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:09:45,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:09:45,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:09:45,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:45" (1/1) ... [2022-04-27 15:09:45,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:09:45,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:09:45,209 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-27 15:09:45,221 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-27 15:09:45,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:09:45,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:09:45,238 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:09:45,238 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:09:45,239 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:09:45,240 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:09:45,240 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:09:45,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:09:45,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:09:45,240 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:09:45,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:09:45,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:09:45,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:09:45,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:09:45,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:09:45,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:09:45,304 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:09:45,305 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:09:45,513 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:09:45,518 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:09:45,518 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:09:45,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:09:45 BoogieIcfgContainer [2022-04-27 15:09:45,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:09:45,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:09:45,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:09:45,522 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:09:45,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:09:44" (1/3) ... [2022-04-27 15:09:45,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9f9813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:09:45, skipping insertion in model container [2022-04-27 15:09:45,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:45" (2/3) ... [2022-04-27 15:09:45,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9f9813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:09:45, skipping insertion in model container [2022-04-27 15:09:45,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:09:45" (3/3) ... [2022-04-27 15:09:45,532 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_14-2.c [2022-04-27 15:09:45,541 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:09:45,542 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:09:45,570 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:09:45,574 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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@5c7b8eb9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@641bbf77 [2022-04-27 15:09:45,574 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:09:45,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 52 states have internal predecessors, (97), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:09:45,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 15:09:45,584 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:45,585 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, 1, 1, 1] [2022-04-27 15:09:45,585 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:45,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:45,591 INFO L85 PathProgramCache]: Analyzing trace with hash -406525713, now seen corresponding path program 1 times [2022-04-27 15:09:45,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:45,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665794838] [2022-04-27 15:09:45,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:45,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:45,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:45,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {60#true} is VALID [2022-04-27 15:09:45,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#true} assume true; {60#true} is VALID [2022-04-27 15:09:45,871 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60#true} {60#true} #268#return; {60#true} is VALID [2022-04-27 15:09:45,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {60#true} call ULTIMATE.init(); {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:45,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {60#true} is VALID [2022-04-27 15:09:45,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {60#true} assume true; {60#true} is VALID [2022-04-27 15:09:45,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60#true} {60#true} #268#return; {60#true} is VALID [2022-04-27 15:09:45,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {60#true} call #t~ret19 := main(); {60#true} is VALID [2022-04-27 15:09:45,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {60#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {60#true} is VALID [2022-04-27 15:09:45,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {60#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {60#true} is VALID [2022-04-27 15:09:45,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {60#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {60#true} is VALID [2022-04-27 15:09:45,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {60#true} assume 0 != ~p1~0;~lk1~0 := 1; {65#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:45,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {65#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {65#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:45,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {65#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {65#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:45,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {65#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {65#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:45,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {65#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {65#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:45,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {65#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {65#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:45,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {65#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {65#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:45,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {65#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {65#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:45,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {65#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {65#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:45,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {65#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {65#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:45,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {65#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {65#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:45,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {65#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {65#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:45,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {65#(not (= main_~p1~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {65#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:45,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {65#(not (= main_~p1~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {65#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:45,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {65#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {61#false} is VALID [2022-04-27 15:09:45,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {61#false} assume !(0 != ~p2~0); {61#false} is VALID [2022-04-27 15:09:45,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {61#false} assume !false; {61#false} is VALID [2022-04-27 15:09:45,907 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-27 15:09:45,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:45,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665794838] [2022-04-27 15:09:45,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665794838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:45,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:45,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:45,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010815967] [2022-04-27 15:09:45,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:45,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:09:45,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:45,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:45,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:45,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:45,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:45,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:45,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:45,986 INFO L87 Difference]: Start difference. First operand has 57 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 52 states have internal predecessors, (97), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:46,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:46,364 INFO L93 Difference]: Finished difference Result 156 states and 288 transitions. [2022-04-27 15:09:46,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:46,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:09:46,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:46,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:46,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 288 transitions. [2022-04-27 15:09:46,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:46,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 288 transitions. [2022-04-27 15:09:46,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 288 transitions. [2022-04-27 15:09:46,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 288 edges. 288 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:46,632 INFO L225 Difference]: With dead ends: 156 [2022-04-27 15:09:46,633 INFO L226 Difference]: Without dead ends: 97 [2022-04-27 15:09:46,635 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-27 15:09:46,640 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 193 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:46,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 164 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:46,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-27 15:09:46,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2022-04-27 15:09:46,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:46,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 95 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:46,670 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 95 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:46,671 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 95 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:46,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:46,675 INFO L93 Difference]: Finished difference Result 97 states and 176 transitions. [2022-04-27 15:09:46,675 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 176 transitions. [2022-04-27 15:09:46,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:46,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:46,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states. [2022-04-27 15:09:46,677 INFO L87 Difference]: Start difference. First operand has 95 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states. [2022-04-27 15:09:46,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:46,682 INFO L93 Difference]: Finished difference Result 97 states and 176 transitions. [2022-04-27 15:09:46,682 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 176 transitions. [2022-04-27 15:09:46,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:46,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:46,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:46,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:46,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:46,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 175 transitions. [2022-04-27 15:09:46,706 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 175 transitions. Word has length 25 [2022-04-27 15:09:46,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:46,707 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 175 transitions. [2022-04-27 15:09:46,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:46,707 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 175 transitions. [2022-04-27 15:09:46,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 15:09:46,708 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:46,708 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, 1, 1, 1] [2022-04-27 15:09:46,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:09:46,708 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:46,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:46,709 INFO L85 PathProgramCache]: Analyzing trace with hash -406532905, now seen corresponding path program 1 times [2022-04-27 15:09:46,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:46,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876178785] [2022-04-27 15:09:46,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:46,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:46,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:46,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {543#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {537#true} is VALID [2022-04-27 15:09:46,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {537#true} assume true; {537#true} is VALID [2022-04-27 15:09:46,787 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {537#true} {537#true} #268#return; {537#true} is VALID [2022-04-27 15:09:46,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {537#true} call ULTIMATE.init(); {543#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:46,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {543#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {537#true} is VALID [2022-04-27 15:09:46,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {537#true} assume true; {537#true} is VALID [2022-04-27 15:09:46,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {537#true} {537#true} #268#return; {537#true} is VALID [2022-04-27 15:09:46,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {537#true} call #t~ret19 := main(); {537#true} is VALID [2022-04-27 15:09:46,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {537#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {537#true} is VALID [2022-04-27 15:09:46,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {537#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {537#true} is VALID [2022-04-27 15:09:46,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {537#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {537#true} is VALID [2022-04-27 15:09:46,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {537#true} assume 0 != ~p1~0;~lk1~0 := 1; {542#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:46,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {542#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {542#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:46,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {542#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {542#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:46,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {542#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {542#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:46,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {542#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {542#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:46,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {542#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {542#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:46,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {542#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {542#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:46,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {542#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {542#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:46,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {542#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {542#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:46,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {542#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {542#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:46,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {542#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {542#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:46,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {542#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {542#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:46,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {542#(= main_~lk1~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {542#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:46,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {542#(= main_~lk1~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {542#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:46,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {542#(= main_~lk1~0 1)} assume 0 != ~p1~0; {542#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:46,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {542#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {538#false} is VALID [2022-04-27 15:09:46,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {538#false} assume !false; {538#false} is VALID [2022-04-27 15:09:46,795 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-27 15:09:46,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:46,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876178785] [2022-04-27 15:09:46,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876178785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:46,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:46,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:46,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260899120] [2022-04-27 15:09:46,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:46,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:09:46,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:46,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:46,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:46,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:46,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:46,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:46,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:46,818 INFO L87 Difference]: Start difference. First operand 95 states and 175 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:46,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:46,996 INFO L93 Difference]: Finished difference Result 98 states and 178 transitions. [2022-04-27 15:09:46,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:46,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:09:46,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:46,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:47,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-27 15:09:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:47,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-27 15:09:47,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-27 15:09:47,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:47,089 INFO L225 Difference]: With dead ends: 98 [2022-04-27 15:09:47,089 INFO L226 Difference]: Without dead ends: 96 [2022-04-27 15:09:47,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-27 15:09:47,095 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 128 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:47,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 99 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:47,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-27 15:09:47,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-27 15:09:47,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:47,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 92 states have (on average 1.8804347826086956) internal successors, (173), 92 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:47,113 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 92 states have (on average 1.8804347826086956) internal successors, (173), 92 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:47,113 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 92 states have (on average 1.8804347826086956) internal successors, (173), 92 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:47,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:47,117 INFO L93 Difference]: Finished difference Result 96 states and 176 transitions. [2022-04-27 15:09:47,117 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 176 transitions. [2022-04-27 15:09:47,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:47,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:47,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 92 states have (on average 1.8804347826086956) internal successors, (173), 92 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 96 states. [2022-04-27 15:09:47,119 INFO L87 Difference]: Start difference. First operand has 96 states, 92 states have (on average 1.8804347826086956) internal successors, (173), 92 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 96 states. [2022-04-27 15:09:47,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:47,122 INFO L93 Difference]: Finished difference Result 96 states and 176 transitions. [2022-04-27 15:09:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 176 transitions. [2022-04-27 15:09:47,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:47,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:47,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:47,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:47,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 92 states have (on average 1.8804347826086956) internal successors, (173), 92 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:47,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 176 transitions. [2022-04-27 15:09:47,125 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 176 transitions. Word has length 25 [2022-04-27 15:09:47,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:47,126 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 176 transitions. [2022-04-27 15:09:47,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:47,126 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 176 transitions. [2022-04-27 15:09:47,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 15:09:47,126 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:47,127 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, 1, 1, 1] [2022-04-27 15:09:47,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:09:47,135 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:47,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:47,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1994873615, now seen corresponding path program 1 times [2022-04-27 15:09:47,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:47,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458607602] [2022-04-27 15:09:47,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:47,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:09:47,183 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 15:09:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:09:47,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 15:09:47,235 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 15:09:47,236 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:09:47,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:09:47,240 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 15:09:47,243 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:09:47,292 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 15:09:47,292 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 15:09:47,292 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 15:09:47,292 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 15:09:47,292 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 15:09:47,293 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 15:09:47,293 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 15:09:47,293 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 15:09:47,293 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 15:09:47,293 WARN L170 areAnnotationChecker]: L211 has no Hoare annotation [2022-04-27 15:09:47,293 WARN L170 areAnnotationChecker]: L211 has no Hoare annotation [2022-04-27 15:09:47,293 WARN L170 areAnnotationChecker]: L211 has no Hoare annotation [2022-04-27 15:09:47,293 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 15:09:47,293 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 15:09:47,293 WARN L170 areAnnotationChecker]: L217 has no Hoare annotation [2022-04-27 15:09:47,293 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-27 15:09:47,293 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-27 15:09:47,293 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:09:47,293 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-04-27 15:09:47,293 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-04-27 15:09:47,293 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 15:09:47,294 WARN L170 areAnnotationChecker]: L88-2 has no Hoare annotation [2022-04-27 15:09:47,294 WARN L170 areAnnotationChecker]: L88-2 has no Hoare annotation [2022-04-27 15:09:47,294 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2022-04-27 15:09:47,294 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2022-04-27 15:09:47,294 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2022-04-27 15:09:47,294 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2022-04-27 15:09:47,294 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2022-04-27 15:09:47,294 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2022-04-27 15:09:47,294 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-04-27 15:09:47,294 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-04-27 15:09:47,294 WARN L170 areAnnotationChecker]: L108-1 has no Hoare annotation [2022-04-27 15:09:47,294 WARN L170 areAnnotationChecker]: L108-1 has no Hoare annotation [2022-04-27 15:09:47,294 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-04-27 15:09:47,294 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-04-27 15:09:47,294 WARN L170 areAnnotationChecker]: L116-1 has no Hoare annotation [2022-04-27 15:09:47,294 WARN L170 areAnnotationChecker]: L116-1 has no Hoare annotation [2022-04-27 15:09:47,294 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2022-04-27 15:09:47,295 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2022-04-27 15:09:47,295 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-04-27 15:09:47,295 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-04-27 15:09:47,295 WARN L170 areAnnotationChecker]: L128-1 has no Hoare annotation [2022-04-27 15:09:47,295 WARN L170 areAnnotationChecker]: L128-1 has no Hoare annotation [2022-04-27 15:09:47,295 WARN L170 areAnnotationChecker]: L132-1 has no Hoare annotation [2022-04-27 15:09:47,295 WARN L170 areAnnotationChecker]: L132-1 has no Hoare annotation [2022-04-27 15:09:47,295 WARN L170 areAnnotationChecker]: L136-1 has no Hoare annotation [2022-04-27 15:09:47,295 WARN L170 areAnnotationChecker]: L136-1 has no Hoare annotation [2022-04-27 15:09:47,295 WARN L170 areAnnotationChecker]: L140-1 has no Hoare annotation [2022-04-27 15:09:47,295 WARN L170 areAnnotationChecker]: L140-1 has no Hoare annotation [2022-04-27 15:09:47,295 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-04-27 15:09:47,295 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-04-27 15:09:47,295 WARN L170 areAnnotationChecker]: L146-1 has no Hoare annotation [2022-04-27 15:09:47,295 WARN L170 areAnnotationChecker]: L146-1 has no Hoare annotation [2022-04-27 15:09:47,295 WARN L170 areAnnotationChecker]: L214 has no Hoare annotation [2022-04-27 15:09:47,295 WARN L170 areAnnotationChecker]: L214 has no Hoare annotation [2022-04-27 15:09:47,296 WARN L170 areAnnotationChecker]: L152 has no Hoare annotation [2022-04-27 15:09:47,296 WARN L170 areAnnotationChecker]: L152 has no Hoare annotation [2022-04-27 15:09:47,296 WARN L170 areAnnotationChecker]: L151 has no Hoare annotation [2022-04-27 15:09:47,296 WARN L170 areAnnotationChecker]: L151 has no Hoare annotation [2022-04-27 15:09:47,296 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-04-27 15:09:47,296 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-04-27 15:09:47,296 WARN L170 areAnnotationChecker]: L156-1 has no Hoare annotation [2022-04-27 15:09:47,296 WARN L170 areAnnotationChecker]: L156-1 has no Hoare annotation [2022-04-27 15:09:47,296 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2022-04-27 15:09:47,296 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2022-04-27 15:09:47,296 WARN L170 areAnnotationChecker]: L161-1 has no Hoare annotation [2022-04-27 15:09:47,296 WARN L170 areAnnotationChecker]: L161-1 has no Hoare annotation [2022-04-27 15:09:47,296 WARN L170 areAnnotationChecker]: L167 has no Hoare annotation [2022-04-27 15:09:47,296 WARN L170 areAnnotationChecker]: L167 has no Hoare annotation [2022-04-27 15:09:47,296 WARN L170 areAnnotationChecker]: L166-1 has no Hoare annotation [2022-04-27 15:09:47,296 WARN L170 areAnnotationChecker]: L166-1 has no Hoare annotation [2022-04-27 15:09:47,296 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2022-04-27 15:09:47,297 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2022-04-27 15:09:47,297 WARN L170 areAnnotationChecker]: L171-1 has no Hoare annotation [2022-04-27 15:09:47,297 WARN L170 areAnnotationChecker]: L171-1 has no Hoare annotation [2022-04-27 15:09:47,297 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-04-27 15:09:47,297 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-04-27 15:09:47,297 WARN L170 areAnnotationChecker]: L176-1 has no Hoare annotation [2022-04-27 15:09:47,297 WARN L170 areAnnotationChecker]: L176-1 has no Hoare annotation [2022-04-27 15:09:47,297 WARN L170 areAnnotationChecker]: L182 has no Hoare annotation [2022-04-27 15:09:47,297 WARN L170 areAnnotationChecker]: L182 has no Hoare annotation [2022-04-27 15:09:47,297 WARN L170 areAnnotationChecker]: L181-1 has no Hoare annotation [2022-04-27 15:09:47,297 WARN L170 areAnnotationChecker]: L181-1 has no Hoare annotation [2022-04-27 15:09:47,297 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2022-04-27 15:09:47,297 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2022-04-27 15:09:47,297 WARN L170 areAnnotationChecker]: L186-1 has no Hoare annotation [2022-04-27 15:09:47,297 WARN L170 areAnnotationChecker]: L186-1 has no Hoare annotation [2022-04-27 15:09:47,297 WARN L170 areAnnotationChecker]: L192 has no Hoare annotation [2022-04-27 15:09:47,297 WARN L170 areAnnotationChecker]: L192 has no Hoare annotation [2022-04-27 15:09:47,298 WARN L170 areAnnotationChecker]: L191-1 has no Hoare annotation [2022-04-27 15:09:47,298 WARN L170 areAnnotationChecker]: L191-1 has no Hoare annotation [2022-04-27 15:09:47,298 WARN L170 areAnnotationChecker]: L197 has no Hoare annotation [2022-04-27 15:09:47,298 WARN L170 areAnnotationChecker]: L197 has no Hoare annotation [2022-04-27 15:09:47,298 WARN L170 areAnnotationChecker]: L196-1 has no Hoare annotation [2022-04-27 15:09:47,298 WARN L170 areAnnotationChecker]: L196-1 has no Hoare annotation [2022-04-27 15:09:47,298 WARN L170 areAnnotationChecker]: L202 has no Hoare annotation [2022-04-27 15:09:47,298 WARN L170 areAnnotationChecker]: L202 has no Hoare annotation [2022-04-27 15:09:47,298 WARN L170 areAnnotationChecker]: L201-1 has no Hoare annotation [2022-04-27 15:09:47,298 WARN L170 areAnnotationChecker]: L201-1 has no Hoare annotation [2022-04-27 15:09:47,298 WARN L170 areAnnotationChecker]: L207 has no Hoare annotation [2022-04-27 15:09:47,298 WARN L170 areAnnotationChecker]: L207 has no Hoare annotation [2022-04-27 15:09:47,298 WARN L170 areAnnotationChecker]: L206-1 has no Hoare annotation [2022-04-27 15:09:47,298 WARN L170 areAnnotationChecker]: L206-1 has no Hoare annotation [2022-04-27 15:09:47,298 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-04-27 15:09:47,298 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-04-27 15:09:47,298 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 15:09:47,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:09:47 BoogieIcfgContainer [2022-04-27 15:09:47,299 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:09:47,300 INFO L158 Benchmark]: Toolchain (without parser) took 2406.26ms. Allocated memory was 232.8MB in the beginning and 339.7MB in the end (delta: 107.0MB). Free memory was 182.7MB in the beginning and 235.6MB in the end (delta: -53.0MB). Peak memory consumption was 54.3MB. Max. memory is 8.0GB. [2022-04-27 15:09:47,300 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 232.8MB. Free memory is still 198.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:09:47,301 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.84ms. Allocated memory is still 232.8MB. Free memory was 182.4MB in the beginning and 207.6MB in the end (delta: -25.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 15:09:47,301 INFO L158 Benchmark]: Boogie Preprocessor took 39.44ms. Allocated memory is still 232.8MB. Free memory was 207.6MB in the beginning and 206.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 15:09:47,301 INFO L158 Benchmark]: RCFGBuilder took 343.18ms. Allocated memory is still 232.8MB. Free memory was 205.5MB in the beginning and 189.7MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-27 15:09:47,302 INFO L158 Benchmark]: TraceAbstraction took 1779.02ms. Allocated memory was 232.8MB in the beginning and 339.7MB in the end (delta: 107.0MB). Free memory was 188.7MB in the beginning and 235.6MB in the end (delta: -46.9MB). Peak memory consumption was 59.5MB. Max. memory is 8.0GB. [2022-04-27 15:09:47,303 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.10ms. Allocated memory is still 232.8MB. Free memory is still 198.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 239.84ms. Allocated memory is still 232.8MB. Free memory was 182.4MB in the beginning and 207.6MB in the end (delta: -25.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.44ms. Allocated memory is still 232.8MB. Free memory was 207.6MB in the beginning and 206.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 343.18ms. Allocated memory is still 232.8MB. Free memory was 205.5MB in the beginning and 189.7MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 1779.02ms. Allocated memory was 232.8MB in the beginning and 339.7MB in the end (delta: 107.0MB). Free memory was 188.7MB in the beginning and 235.6MB in the end (delta: -46.9MB). Peak memory consumption was 59.5MB. 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 - CounterExampleResult [Line: 219]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; VAL [p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L88] COND FALSE !(p1 != 0) VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L92] COND FALSE !(p2 != 0) VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L96] COND TRUE p3 != 0 [L97] lk3 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L100] COND TRUE p4 != 0 [L101] lk4 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L104] COND TRUE p5 != 0 [L105] lk5 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L108] COND TRUE p6 != 0 [L109] lk6 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=0, lk8=0, lk9=0, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L112] COND TRUE p7 != 0 [L113] lk7 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L116] COND TRUE p8 != 0 [L117] lk8 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L120] COND TRUE p9 != 0 [L121] lk9 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L124] COND FALSE !(p10 != 0) VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L128] COND TRUE p11 != 0 [L129] lk11 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=1, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L132] COND TRUE p12 != 0 [L133] lk12 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=1, lk12=1, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L136] COND TRUE p13 != 0 [L137] lk13 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=1, lk12=1, lk13=1, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L140] COND TRUE p14 != 0 [L141] lk14 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=1, lk12=1, lk13=1, lk14=1, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L146] COND FALSE !(p1 != 0) VAL [cond=1, lk1=0, lk10=0, lk11=1, lk12=1, lk13=1, lk14=1, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L151] COND FALSE !(p2 != 0) VAL [cond=1, lk1=0, lk10=0, lk11=1, lk12=1, lk13=1, lk14=1, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] [L219] reach_error() VAL [cond=1, lk1=0, lk10=0, lk11=1, lk12=1, lk13=1, lk14=1, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=0, p11=1, p12=1, p13=-1, p14=1, p2=0, p3=1, p4=1, p5=-2, p6=1, p7=1, p8=1, p9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 321 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 321 mSDsluCounter, 263 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 183 IncrementalHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 247 mSDtfsCounter, 183 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=2, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-27 15:09:47,332 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...