/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05ce600 [2022-02-24 01:52:24,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-24 01:52:24,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-24 01:52:24,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-24 01:52:24,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-24 01:52:24,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-24 01:52:24,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-24 01:52:24,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-24 01:52:24,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-24 01:52:24,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-24 01:52:24,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-24 01:52:24,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-24 01:52:24,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-24 01:52:24,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-24 01:52:24,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-24 01:52:24,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-24 01:52:24,424 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-24 01:52:24,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-24 01:52:24,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-24 01:52:24,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-24 01:52:24,428 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-24 01:52:24,431 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-24 01:52:24,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-24 01:52:24,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-24 01:52:24,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-24 01:52:24,444 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-24 01:52:24,444 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-24 01:52:24,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-24 01:52:24,446 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-24 01:52:24,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-24 01:52:24,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-24 01:52:24,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-24 01:52:24,450 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-24 01:52:24,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-24 01:52:24,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-24 01:52:24,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-24 01:52:24,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-24 01:52:24,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-24 01:52:24,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-24 01:52:24,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-24 01:52:24,454 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-24 01:52:24,454 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-02-24 01:52:24,468 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-24 01:52:24,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-24 01:52:24,470 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-24 01:52:24,470 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-24 01:52:24,470 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-24 01:52:24,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-24 01:52:24,471 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-24 01:52:24,471 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-24 01:52:24,471 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-24 01:52:24,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-24 01:52:24,472 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-24 01:52:24,472 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-24 01:52:24,472 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-24 01:52:24,472 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-24 01:52:24,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-24 01:52:24,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-24 01:52:24,473 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-24 01:52:24,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-24 01:52:24,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 01:52:24,473 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-24 01:52:24,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-02-24 01:52:24,473 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-24 01:52:24,473 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-02-24 01:52:24,473 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-02-24 01:52:24,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-24 01:52:24,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-24 01:52:24,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-24 01:52:24,716 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-24 01:52:24,718 INFO L275 PluginConnector]: CDTParser initialized [2022-02-24 01:52:24,719 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound1.c [2022-02-24 01:52:24,786 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685b97a15/f846a9fca7f64c30806ef1fff80e4e02/FLAG66f07a78f [2022-02-24 01:52:25,198 INFO L306 CDTParser]: Found 1 translation units. [2022-02-24 01:52:25,199 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound1.c [2022-02-24 01:52:25,211 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685b97a15/f846a9fca7f64c30806ef1fff80e4e02/FLAG66f07a78f [2022-02-24 01:52:25,226 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685b97a15/f846a9fca7f64c30806ef1fff80e4e02 [2022-02-24 01:52:25,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-24 01:52:25,230 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-24 01:52:25,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-24 01:52:25,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-24 01:52:25,234 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-24 01:52:25,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 01:52:25" (1/1) ... [2022-02-24 01:52:25,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e3d1bf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:52:25, skipping insertion in model container [2022-02-24 01:52:25,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 01:52:25" (1/1) ... [2022-02-24 01:52:25,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-24 01:52:25,262 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-24 01:52:25,411 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound1.c[525,538] [2022-02-24 01:52:25,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 01:52:25,462 INFO L203 MainTranslator]: Completed pre-run [2022-02-24 01:52:25,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound1.c[525,538] [2022-02-24 01:52:25,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 01:52:25,495 INFO L208 MainTranslator]: Completed translation [2022-02-24 01:52:25,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:52:25 WrapperNode [2022-02-24 01:52:25,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-24 01:52:25,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-24 01:52:25,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-24 01:52:25,496 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-24 01:52:25,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:52:25" (1/1) ... [2022-02-24 01:52:25,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:52:25" (1/1) ... [2022-02-24 01:52:25,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:52:25" (1/1) ... [2022-02-24 01:52:25,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:52:25" (1/1) ... [2022-02-24 01:52:25,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:52:25" (1/1) ... [2022-02-24 01:52:25,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:52:25" (1/1) ... [2022-02-24 01:52:25,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:52:25" (1/1) ... [2022-02-24 01:52:25,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-24 01:52:25,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-24 01:52:25,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-24 01:52:25,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-24 01:52:25,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:52:25" (1/1) ... [2022-02-24 01:52:25,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 01:52:25,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-24 01:52:25,548 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-02-24 01:52:25,554 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-02-24 01:52:25,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-24 01:52:25,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-24 01:52:25,578 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-24 01:52:25,578 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-24 01:52:25,578 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-24 01:52:25,578 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-24 01:52:25,578 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-24 01:52:25,578 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-24 01:52:25,578 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-24 01:52:25,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-24 01:52:25,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-02-24 01:52:25,579 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-24 01:52:25,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-24 01:52:25,579 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-24 01:52:25,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-24 01:52:25,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-24 01:52:25,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-24 01:52:25,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-24 01:52:25,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-24 01:52:25,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-24 01:52:25,628 INFO L234 CfgBuilder]: Building ICFG [2022-02-24 01:52:25,630 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-24 01:52:25,769 INFO L275 CfgBuilder]: Performing block encoding [2022-02-24 01:52:25,775 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-24 01:52:25,775 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-24 01:52:25,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 01:52:25 BoogieIcfgContainer [2022-02-24 01:52:25,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-24 01:52:25,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-24 01:52:25,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-24 01:52:25,787 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-24 01:52:25,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.02 01:52:25" (1/3) ... [2022-02-24 01:52:25,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b629f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 01:52:25, skipping insertion in model container [2022-02-24 01:52:25,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:52:25" (2/3) ... [2022-02-24 01:52:25,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b629f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 01:52:25, skipping insertion in model container [2022-02-24 01:52:25,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 01:52:25" (3/3) ... [2022-02-24 01:52:25,789 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound1.c [2022-02-24 01:52:25,793 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-02-24 01:52:25,793 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-24 01:52:25,828 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-24 01:52:25,834 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, 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, mLoopAccelerationTechnique=JORDAN [2022-02-24 01:52:25,834 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-24 01:52:25,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-24 01:52:25,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-24 01:52:25,852 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:52:25,852 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:52:25,853 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:52:25,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:52:25,857 INFO L85 PathProgramCache]: Analyzing trace with hash 223850557, now seen corresponding path program 1 times [2022-02-24 01:52:25,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:52:25,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2123586862] [2022-02-24 01:52:25,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:52:25,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:52:25,929 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:52:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:52:26,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:52:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:52:26,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 01:52:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:52:26,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-24 01:52:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:52:26,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-24 01:52:26,131 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:52:26,131 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2123586862] [2022-02-24 01:52:26,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2123586862] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:52:26,133 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:52:26,133 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-24 01:52:26,134 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862410674] [2022-02-24 01:52:26,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:52:26,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-24 01:52:26,138 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:52:26,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-24 01:52:26,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-24 01:52:26,161 INFO L87 Difference]: Start difference. First operand has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-24 01:52:28,241 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:52:30,365 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:52:30,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:52:30,511 INFO L93 Difference]: Finished difference Result 69 states and 113 transitions. [2022-02-24 01:52:30,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-24 01:52:30,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-02-24 01:52:30,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:52:30,523 INFO L225 Difference]: With dead ends: 69 [2022-02-24 01:52:30,523 INFO L226 Difference]: Without dead ends: 33 [2022-02-24 01:52:30,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-24 01:52:30,533 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 14 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-02-24 01:52:30,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 43 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 9 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-02-24 01:52:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-24 01:52:30,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-24 01:52:30,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-24 01:52:30,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-02-24 01:52:30,597 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2022-02-24 01:52:30,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:52:30,597 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-02-24 01:52:30,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-24 01:52:30,598 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-02-24 01:52:30,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-24 01:52:30,599 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:52:30,600 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:52:30,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-24 01:52:30,600 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:52:30,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:52:30,601 INFO L85 PathProgramCache]: Analyzing trace with hash -563604624, now seen corresponding path program 1 times [2022-02-24 01:52:30,601 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:52:30,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [622497728] [2022-02-24 01:52:30,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:52:30,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:52:30,610 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:52:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:52:30,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:52:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:52:30,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 01:52:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:52:30,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-24 01:52:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:52:30,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-24 01:52:30,835 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:52:30,835 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [622497728] [2022-02-24 01:52:30,835 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [622497728] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:52:30,835 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:52:30,836 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-24 01:52:30,836 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350426380] [2022-02-24 01:52:30,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:52:30,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-24 01:52:30,837 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:52:30,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-24 01:52:30,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-24 01:52:30,838 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-24 01:52:33,045 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:52:34,335 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:52:36,090 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:52:38,111 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:52:38,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:52:38,833 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-02-24 01:52:38,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-24 01:52:38,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-02-24 01:52:38,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:52:38,836 INFO L225 Difference]: With dead ends: 46 [2022-02-24 01:52:38,836 INFO L226 Difference]: Without dead ends: 44 [2022-02-24 01:52:38,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-02-24 01:52:38,838 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 32 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 26 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-02-24 01:52:38,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 53 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 177 Invalid, 2 Unknown, 0 Unchecked, 7.9s Time] [2022-02-24 01:52:38,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-24 01:52:38,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-02-24 01:52:38,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-24 01:52:38,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2022-02-24 01:52:38,851 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 24 [2022-02-24 01:52:38,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:52:38,851 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2022-02-24 01:52:38,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-24 01:52:38,851 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2022-02-24 01:52:38,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-24 01:52:38,852 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:52:38,852 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:52:38,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-24 01:52:38,853 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:52:38,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:52:38,853 INFO L85 PathProgramCache]: Analyzing trace with hash -5094773, now seen corresponding path program 1 times [2022-02-24 01:52:38,853 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:52:38,853 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1133787607] [2022-02-24 01:52:38,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:52:38,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:52:38,855 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:52:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:52:39,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:52:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:52:39,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 01:52:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:52:39,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-24 01:52:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:52:39,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-24 01:52:39,048 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:52:39,048 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1133787607] [2022-02-24 01:52:39,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1133787607] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:52:39,049 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:52:39,049 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-24 01:52:39,049 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676097272] [2022-02-24 01:52:39,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:52:39,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-24 01:52:39,049 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:52:39,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-24 01:52:39,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-24 01:52:39,050 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-24 01:52:42,188 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-24 01:52:44,191 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-24 01:52:46,193 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-24 01:52:50,839 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:52:52,956 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:52:55,558 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:52:57,588 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:52:57,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:52:57,695 INFO L93 Difference]: Finished difference Result 66 states and 93 transitions. [2022-02-24 01:52:57,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-24 01:52:57,696 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-02-24 01:52:57,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:52:57,697 INFO L225 Difference]: With dead ends: 66 [2022-02-24 01:52:57,697 INFO L226 Difference]: Without dead ends: 62 [2022-02-24 01:52:57,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-02-24 01:52:57,700 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 43 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 92 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2022-02-24 01:52:57,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 55 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 213 Invalid, 7 Unknown, 0 Unchecked, 18.5s Time] [2022-02-24 01:52:57,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-02-24 01:52:57,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2022-02-24 01:52:57,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-24 01:52:57,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 77 transitions. [2022-02-24 01:52:57,717 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 77 transitions. Word has length 26 [2022-02-24 01:52:57,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:52:57,718 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 77 transitions. [2022-02-24 01:52:57,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-24 01:52:57,718 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 77 transitions. [2022-02-24 01:52:57,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-24 01:52:57,721 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:52:57,721 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:52:57,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-24 01:52:57,721 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:52:57,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:52:57,722 INFO L85 PathProgramCache]: Analyzing trace with hash -148039962, now seen corresponding path program 2 times [2022-02-24 01:52:57,722 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:52:57,722 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1281382851] [2022-02-24 01:52:57,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:52:57,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:52:57,724 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:52:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:52:58,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:52:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:52:58,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 01:52:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:52:58,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-24 01:52:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:52:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-24 01:52:58,048 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:52:58,048 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1281382851] [2022-02-24 01:52:58,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1281382851] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:52:58,049 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:52:58,049 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-24 01:52:58,049 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458316794] [2022-02-24 01:52:58,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:52:58,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-24 01:52:58,049 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:52:58,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-24 01:52:58,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-24 01:52:58,050 INFO L87 Difference]: Start difference. First operand 57 states and 77 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-24 01:53:02,890 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:53:05,861 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:53:08,573 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:53:11,248 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:53:13,341 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:53:15,492 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-24 01:53:17,496 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-24 01:53:19,501 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-24 01:53:21,505 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-24 01:53:23,526 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:53:25,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:53:27,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:53:27,488 INFO L93 Difference]: Finished difference Result 99 states and 144 transitions. [2022-02-24 01:53:27,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-24 01:53:27,489 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-02-24 01:53:27,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:53:27,491 INFO L225 Difference]: With dead ends: 99 [2022-02-24 01:53:27,491 INFO L226 Difference]: Without dead ends: 78 [2022-02-24 01:53:27,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-02-24 01:53:27,493 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 51 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 131 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.1s IncrementalHoareTripleChecker+Time [2022-02-24 01:53:27,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 66 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 305 Invalid, 10 Unknown, 0 Unchecked, 29.1s Time] [2022-02-24 01:53:27,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-24 01:53:27,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-02-24 01:53:27,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 39 states have internal predecessors, (45), 32 states have call successors, (32), 7 states have call predecessors, (32), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-02-24 01:53:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 106 transitions. [2022-02-24 01:53:27,519 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 106 transitions. Word has length 28 [2022-02-24 01:53:27,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:53:27,519 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 106 transitions. [2022-02-24 01:53:27,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-24 01:53:27,520 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 106 transitions. [2022-02-24 01:53:27,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-24 01:53:27,523 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:53:27,527 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:53:27,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-24 01:53:27,528 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:53:27,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:53:27,528 INFO L85 PathProgramCache]: Analyzing trace with hash -79413119, now seen corresponding path program 3 times [2022-02-24 01:53:27,528 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:53:27,528 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [293921459] [2022-02-24 01:53:27,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:53:27,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:53:27,530 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:53:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:53:27,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:53:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:53:27,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 01:53:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:53:27,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-24 01:53:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:53:27,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-24 01:53:27,843 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:53:27,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [293921459] [2022-02-24 01:53:27,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [293921459] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:53:27,843 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:53:27,843 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-24 01:53:27,844 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035563545] [2022-02-24 01:53:27,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:53:27,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-24 01:53:27,844 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:53:27,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-24 01:53:27,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-02-24 01:53:27,845 INFO L87 Difference]: Start difference. First operand 76 states and 106 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-24 01:53:34,226 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:53:35,705 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:53:38,894 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:53:40,898 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:53:42,902 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:53:44,932 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:53:47,106 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:53:49,244 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:53:51,379 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:53:53,532 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:53:55,687 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:53:58,625 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:54:01,335 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:54:03,486 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:54:05,592 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:54:07,725 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-24 01:54:07,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:54:07,861 INFO L93 Difference]: Finished difference Result 113 states and 163 transitions. [2022-02-24 01:54:07,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-24 01:54:07,861 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2022-02-24 01:54:07,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:54:07,863 INFO L225 Difference]: With dead ends: 113 [2022-02-24 01:54:07,863 INFO L226 Difference]: Without dead ends: 101 [2022-02-24 01:54:07,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-02-24 01:54:07,864 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 58 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 179 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.7s IncrementalHoareTripleChecker+Time [2022-02-24 01:54:07,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 75 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 486 Invalid, 15 Unknown, 0 Unchecked, 39.7s Time] [2022-02-24 01:54:07,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-02-24 01:54:07,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2022-02-24 01:54:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 44 states have call successors, (44), 8 states have call predecessors, (44), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-02-24 01:54:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 141 transitions. [2022-02-24 01:54:07,904 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 141 transitions. Word has length 30 [2022-02-24 01:54:07,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:54:07,904 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 141 transitions. [2022-02-24 01:54:07,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-24 01:54:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 141 transitions. [2022-02-24 01:54:07,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-24 01:54:07,905 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:54:07,905 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:54:07,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-24 01:54:07,906 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:54:07,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:54:07,906 INFO L85 PathProgramCache]: Analyzing trace with hash -2000886032, now seen corresponding path program 1 times [2022-02-24 01:54:07,906 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:54:07,906 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1926111507] [2022-02-24 01:54:07,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:54:07,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:54:07,908 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:54:07,915 WARN L132 FreeRefinementEngine]: Strategy FIXED_PREFERENCES was unsuccessful and could not determine trace feasibility [2022-02-24 01:54:07,915 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2022-02-24 01:54:07,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-24 01:54:07,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-24 01:54:07,925 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2022-02-24 01:54:07,927 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-24 01:54:07,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.02 01:54:07 BoogieIcfgContainer [2022-02-24 01:54:07,935 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-24 01:54:07,935 INFO L158 Benchmark]: Toolchain (without parser) took 102705.34ms. Allocated memory was 199.2MB in the beginning and 247.5MB in the end (delta: 48.2MB). Free memory was 144.0MB in the beginning and 211.8MB in the end (delta: -67.8MB). There was no memory consumed. Max. memory is 8.0GB. [2022-02-24 01:54:07,935 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 199.2MB. Free memory is still 160.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-24 01:54:07,936 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.41ms. Allocated memory was 199.2MB in the beginning and 247.5MB in the end (delta: 48.2MB). Free memory was 143.7MB in the beginning and 216.5MB in the end (delta: -72.8MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2022-02-24 01:54:07,936 INFO L158 Benchmark]: Boogie Preprocessor took 24.92ms. Allocated memory is still 247.5MB. Free memory was 216.5MB in the beginning and 215.3MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-24 01:54:07,936 INFO L158 Benchmark]: RCFGBuilder took 255.26ms. Allocated memory is still 247.5MB. Free memory was 214.9MB in the beginning and 202.9MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-02-24 01:54:07,936 INFO L158 Benchmark]: TraceAbstraction took 102151.16ms. Allocated memory is still 247.5MB. Free memory was 202.3MB in the beginning and 211.8MB in the end (delta: -9.5MB). There was no memory consumed. Max. memory is 8.0GB. [2022-02-24 01:54:07,937 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 199.2MB. Free memory is still 160.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 264.41ms. Allocated memory was 199.2MB in the beginning and 247.5MB in the end (delta: 48.2MB). Free memory was 143.7MB in the beginning and 216.5MB in the end (delta: -72.8MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.92ms. Allocated memory is still 247.5MB. Free memory was 216.5MB in the beginning and 215.3MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 255.26ms. Allocated memory is still 247.5MB. Free memory was 214.9MB in the beginning and 202.9MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 102151.16ms. Allocated memory is still 247.5MB. Free memory was 202.3MB in the beginning and 211.8MB in the end (delta: -9.5MB). There was no memory consumed. 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 - UnprovableResult [Line: 14]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L20] unsigned int n, p, q, r, h; [L22] n = __VERIFIER_nondet_uint() [L23] CALL assume_abort_if_not(n>=0 && n<=1) [L9] COND FALSE !(!cond) [L23] RET assume_abort_if_not(n>=0 && n<=1) [L24] CALL assume_abort_if_not(n < 4294967295 / 4) [L9] COND FALSE !(!cond) [L24] RET assume_abort_if_not(n < 4294967295 / 4) [L26] p = 0 [L27] q = 1 [L28] r = n [L29] h = 0 [L30] COND TRUE 1 [L31] COND TRUE !(q <= n) [L38] COND TRUE 1 [L39] CALL __VERIFIER_assert(r < 2 * p + q) [L12] COND FALSE !(!(cond)) [L39] RET __VERIFIER_assert(r < 2 * p + q) [L40] CALL __VERIFIER_assert(p*p + r*q == n*q) [L12] COND FALSE !(!(cond)) [L40] RET __VERIFIER_assert(p*p + r*q == n*q) [L41] CALL __VERIFIER_assert(h * h * h - 12 * h * n * q + 16 * n * p * q - h * q * q - 4 * p * q * q + 12 * h * q * r - 16 * p * q * r == 0) [L12] COND TRUE !(cond) [L14] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 102.1s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 100.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 36 mSolverCounterUnknown, 251 SdHoareTripleChecker+Valid, 99.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 204 mSDsluCounter, 292 SdHoareTripleChecker+Invalid, 97.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 108 mSDsCounter, 442 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1190 IncrementalHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 442 mSolverCounterUnsat, 184 mSDtfsCounter, 1190 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=5, InterpolantAutomatonStates: 47, 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, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-24 01:54:07,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...