/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/reducercommutativity/sum05-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 18:39:41,826 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 18:39:41,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 18:39:41,869 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 18:39:41,870 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 18:39:41,870 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 18:39:41,872 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 18:39:41,873 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 18:39:41,875 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 18:39:41,876 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 18:39:41,877 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 18:39:41,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 18:39:41,881 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 18:39:41,887 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 18:39:41,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 18:39:41,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 18:39:41,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 18:39:41,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 18:39:41,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 18:39:41,898 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 18:39:41,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 18:39:41,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 18:39:41,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 18:39:41,909 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 18:39:41,911 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 18:39:41,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 18:39:41,912 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 18:39:41,912 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 18:39:41,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 18:39:41,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 18:39:41,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 18:39:41,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 18:39:41,915 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 18:39:41,921 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 18:39:41,922 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 18:39:41,923 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 18:39:41,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 18:39:41,923 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 18:39:41,924 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 18:39:41,924 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 18:39:41,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 18:39:41,926 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 18:39:41,939 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 18:39:41,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 18:39:41,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 18:39:41,941 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 18:39:41,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 18:39:41,941 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 18:39:41,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 18:39:41,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 18:39:41,941 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 18:39:41,941 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 18:39:41,942 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 18:39:41,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 18:39:41,942 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 18:39:41,942 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 18:39:41,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 18:39:41,943 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 18:39:41,943 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 18:39:41,943 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 18:39:41,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 18:39:41,943 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 18:39:41,943 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 18:39:41,944 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 18:39:41,944 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 18:39:41,944 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-01-31 18:39:42,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 18:39:42,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 18:39:42,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 18:39:42,169 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 18:39:42,175 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 18:39:42,176 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sum05-2.i [2022-01-31 18:39:42,236 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36288416d/a8281cd5b83d44299d6d36cfa59fb084/FLAG24fbdf03d [2022-01-31 18:39:42,552 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 18:39:42,553 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sum05-2.i [2022-01-31 18:39:42,557 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36288416d/a8281cd5b83d44299d6d36cfa59fb084/FLAG24fbdf03d [2022-01-31 18:39:42,980 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36288416d/a8281cd5b83d44299d6d36cfa59fb084 [2022-01-31 18:39:42,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 18:39:42,984 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 18:39:42,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 18:39:42,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 18:39:42,991 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 18:39:42,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 06:39:42" (1/1) ... [2022-01-31 18:39:42,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34753c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:39:42, skipping insertion in model container [2022-01-31 18:39:42,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 06:39:42" (1/1) ... [2022-01-31 18:39:42,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 18:39:43,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 18:39:43,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sum05-2.i[1271,1284] [2022-01-31 18:39:43,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 18:39:43,166 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 18:39:43,195 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sum05-2.i[1271,1284] [2022-01-31 18:39:43,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 18:39:43,205 INFO L208 MainTranslator]: Completed translation [2022-01-31 18:39:43,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:39:43 WrapperNode [2022-01-31 18:39:43,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 18:39:43,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 18:39:43,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 18:39:43,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 18:39:43,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:39:43" (1/1) ... [2022-01-31 18:39:43,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:39:43" (1/1) ... [2022-01-31 18:39:43,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:39:43" (1/1) ... [2022-01-31 18:39:43,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:39:43" (1/1) ... [2022-01-31 18:39:43,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:39:43" (1/1) ... [2022-01-31 18:39:43,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:39:43" (1/1) ... [2022-01-31 18:39:43,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:39:43" (1/1) ... [2022-01-31 18:39:43,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 18:39:43,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 18:39:43,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 18:39:43,229 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 18:39:43,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:39:43" (1/1) ... [2022-01-31 18:39:43,239 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 18:39:43,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 18:39:43,261 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-01-31 18:39:43,265 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-01-31 18:39:43,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 18:39:43,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 18:39:43,289 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 18:39:43,289 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2022-01-31 18:39:43,289 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 18:39:43,289 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 18:39:43,290 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 18:39:43,290 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-01-31 18:39:43,290 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-01-31 18:39:43,292 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 18:39:43,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 18:39:43,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 18:39:43,292 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2022-01-31 18:39:43,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 18:39:43,293 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 18:39:43,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 18:39:43,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 18:39:43,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 18:39:43,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 18:39:43,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 18:39:43,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 18:39:43,358 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 18:39:43,359 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 18:39:43,462 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 18:39:43,467 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 18:39:43,468 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 18:39:43,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 06:39:43 BoogieIcfgContainer [2022-01-31 18:39:43,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 18:39:43,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 18:39:43,471 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 18:39:43,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 18:39:43,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 06:39:42" (1/3) ... [2022-01-31 18:39:43,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3722b6c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 06:39:43, skipping insertion in model container [2022-01-31 18:39:43,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:39:43" (2/3) ... [2022-01-31 18:39:43,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3722b6c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 06:39:43, skipping insertion in model container [2022-01-31 18:39:43,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 06:39:43" (3/3) ... [2022-01-31 18:39:43,476 INFO L111 eAbstractionObserver]: Analyzing ICFG sum05-2.i [2022-01-31 18:39:43,480 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 18:39:43,480 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 18:39:43,532 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 18:39:43,537 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-01-31 18:39:43,537 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 18:39:43,554 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 18:39:43,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 18:39:43,568 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:39:43,569 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:39:43,570 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:39:43,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:39:43,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1514933818, now seen corresponding path program 1 times [2022-01-31 18:39:43,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:39:43,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [272064922] [2022-01-31 18:39:43,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:39:43,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:39:43,634 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:39:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:43,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:39:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:43,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 18:39:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:43,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-31 18:39:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:43,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 18:39:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 18:39:43,786 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:39:43,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [272064922] [2022-01-31 18:39:43,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [272064922] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:39:43,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:39:43,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 18:39:43,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940873229] [2022-01-31 18:39:43,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:39:43,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 18:39:43,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:39:43,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 18:39:43,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 18:39:43,820 INFO L87 Difference]: Start difference. First operand has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:43,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:39:43,876 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2022-01-31 18:39:43,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 18:39:43,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-01-31 18:39:43,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:39:43,887 INFO L225 Difference]: With dead ends: 54 [2022-01-31 18:39:43,887 INFO L226 Difference]: Without dead ends: 26 [2022-01-31 18:39:43,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-01-31 18:39:43,894 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:39:43,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 35 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:39:43,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-31 18:39:43,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-01-31 18:39:43,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:39:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-01-31 18:39:43,936 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2022-01-31 18:39:43,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:39:43,937 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-01-31 18:39:43,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:43,937 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-01-31 18:39:43,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 18:39:43,938 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:39:43,938 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:39:43,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 18:39:43,939 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:39:43,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:39:43,940 INFO L85 PathProgramCache]: Analyzing trace with hash -649748416, now seen corresponding path program 1 times [2022-01-31 18:39:43,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:39:43,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [16887680] [2022-01-31 18:39:43,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:39:43,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:39:43,944 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:39:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:44,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:39:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:44,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 18:39:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:44,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-31 18:39:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:44,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 18:39:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:44,056 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-31 18:39:44,056 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:39:44,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [16887680] [2022-01-31 18:39:44,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [16887680] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:39:44,057 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:39:44,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 18:39:44,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909791559] [2022-01-31 18:39:44,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:39:44,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 18:39:44,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:39:44,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 18:39:44,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 18:39:44,059 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:44,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:39:44,178 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2022-01-31 18:39:44,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 18:39:44,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-01-31 18:39:44,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:39:44,180 INFO L225 Difference]: With dead ends: 48 [2022-01-31 18:39:44,180 INFO L226 Difference]: Without dead ends: 30 [2022-01-31 18:39:44,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-31 18:39:44,182 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:39:44,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 35 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:39:44,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-31 18:39:44,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-01-31 18:39:44,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:39:44,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-01-31 18:39:44,190 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 32 [2022-01-31 18:39:44,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:39:44,190 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-01-31 18:39:44,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:44,191 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-01-31 18:39:44,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 18:39:44,192 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:39:44,192 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:39:44,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 18:39:44,193 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:39:44,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:39:44,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1359785280, now seen corresponding path program 1 times [2022-01-31 18:39:44,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:39:44,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1379648600] [2022-01-31 18:39:44,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:39:44,209 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:39:44,209 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:39:44,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:39:44,212 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:39:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:44,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:39:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:44,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 18:39:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:44,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 18:39:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:44,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 18:39:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:44,351 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-31 18:39:44,351 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:39:44,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1379648600] [2022-01-31 18:39:44,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1379648600] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:39:44,352 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:39:44,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 18:39:44,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932418121] [2022-01-31 18:39:44,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:39:44,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 18:39:44,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:39:44,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 18:39:44,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 18:39:44,354 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:44,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:39:44,447 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-01-31 18:39:44,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 18:39:44,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-01-31 18:39:44,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:39:44,449 INFO L225 Difference]: With dead ends: 50 [2022-01-31 18:39:44,449 INFO L226 Difference]: Without dead ends: 31 [2022-01-31 18:39:44,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-31 18:39:44,457 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:39:44,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 37 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:39:44,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-31 18:39:44,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-01-31 18:39:44,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:39:44,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-01-31 18:39:44,469 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 40 [2022-01-31 18:39:44,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:39:44,469 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-01-31 18:39:44,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:44,469 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-01-31 18:39:44,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 18:39:44,470 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:39:44,470 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:39:44,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 18:39:44,471 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:39:44,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:39:44,471 INFO L85 PathProgramCache]: Analyzing trace with hash 582810658, now seen corresponding path program 2 times [2022-01-31 18:39:44,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:39:44,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [376631870] [2022-01-31 18:39:44,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:39:44,474 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:39:44,475 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:39:44,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:39:44,480 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:39:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:44,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:39:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:44,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 18:39:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:44,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 18:39:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:44,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-31 18:39:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 18:39:44,639 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:39:44,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [376631870] [2022-01-31 18:39:44,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [376631870] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:39:44,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:39:44,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 18:39:44,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999903107] [2022-01-31 18:39:44,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:39:44,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 18:39:44,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:39:44,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 18:39:44,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 18:39:44,644 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:44,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:39:44,734 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-01-31 18:39:44,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 18:39:44,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2022-01-31 18:39:44,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:39:44,736 INFO L225 Difference]: With dead ends: 51 [2022-01-31 18:39:44,737 INFO L226 Difference]: Without dead ends: 33 [2022-01-31 18:39:44,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-31 18:39:44,739 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:39:44,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 37 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:39:44,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-31 18:39:44,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-01-31 18:39:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:39:44,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-01-31 18:39:44,759 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 42 [2022-01-31 18:39:44,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:39:44,760 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-01-31 18:39:44,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:44,760 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-01-31 18:39:44,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 18:39:44,761 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:39:44,761 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:39:44,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 18:39:44,762 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:39:44,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:39:44,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1957141696, now seen corresponding path program 3 times [2022-01-31 18:39:44,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:39:44,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [272021178] [2022-01-31 18:39:44,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:39:44,765 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:39:44,765 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:39:44,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:39:44,767 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:39:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:44,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:39:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:44,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 18:39:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:44,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 18:39:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:44,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 18:39:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:44,857 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:39:44,857 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:39:44,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [272021178] [2022-01-31 18:39:44,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [272021178] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:39:44,857 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:39:44,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 18:39:44,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727578779] [2022-01-31 18:39:44,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:39:44,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 18:39:44,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:39:44,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 18:39:44,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 18:39:44,859 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:44,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:39:44,909 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-01-31 18:39:44,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 18:39:44,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2022-01-31 18:39:44,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:39:44,913 INFO L225 Difference]: With dead ends: 49 [2022-01-31 18:39:44,913 INFO L226 Difference]: Without dead ends: 34 [2022-01-31 18:39:44,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-01-31 18:39:44,917 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:39:44,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 32 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:39:44,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-31 18:39:44,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-01-31 18:39:44,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:39:44,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-01-31 18:39:44,929 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 48 [2022-01-31 18:39:44,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:39:44,932 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-01-31 18:39:44,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:44,932 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-01-31 18:39:44,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 18:39:44,938 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:39:44,938 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:39:44,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 18:39:44,939 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:39:44,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:39:44,939 INFO L85 PathProgramCache]: Analyzing trace with hash -173524546, now seen corresponding path program 1 times [2022-01-31 18:39:44,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:39:44,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1903024201] [2022-01-31 18:39:44,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:39:44,944 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:39:44,945 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:39:44,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:39:44,946 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:39:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:45,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:39:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:45,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 18:39:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:45,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 18:39:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:45,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-31 18:39:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:39:45,075 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:39:45,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1903024201] [2022-01-31 18:39:45,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1903024201] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:39:45,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:39:45,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 18:39:45,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225862747] [2022-01-31 18:39:45,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:39:45,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 18:39:45,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:39:45,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 18:39:45,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 18:39:45,079 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:45,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:39:45,143 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-01-31 18:39:45,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 18:39:45,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2022-01-31 18:39:45,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:39:45,145 INFO L225 Difference]: With dead ends: 51 [2022-01-31 18:39:45,145 INFO L226 Difference]: Without dead ends: 36 [2022-01-31 18:39:45,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-31 18:39:45,148 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:39:45,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 32 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:39:45,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-31 18:39:45,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-01-31 18:39:45,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:39:45,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-01-31 18:39:45,164 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 50 [2022-01-31 18:39:45,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:39:45,165 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-01-31 18:39:45,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:45,166 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-01-31 18:39:45,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 18:39:45,169 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:39:45,169 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:39:45,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 18:39:45,170 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:39:45,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:39:45,170 INFO L85 PathProgramCache]: Analyzing trace with hash 190605500, now seen corresponding path program 2 times [2022-01-31 18:39:45,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:39:45,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [167527492] [2022-01-31 18:39:45,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:39:45,180 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:39:45,181 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:39:45,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:39:45,183 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:39:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:45,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:39:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:45,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 18:39:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:45,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 18:39:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:45,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 18:39:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:45,314 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:39:45,314 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:39:45,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [167527492] [2022-01-31 18:39:45,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [167527492] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:39:45,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:39:45,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 18:39:45,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824366782] [2022-01-31 18:39:45,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:39:45,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 18:39:45,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:39:45,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 18:39:45,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 18:39:45,328 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:45,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:39:45,397 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2022-01-31 18:39:45,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 18:39:45,397 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2022-01-31 18:39:45,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:39:45,399 INFO L225 Difference]: With dead ends: 62 [2022-01-31 18:39:45,399 INFO L226 Difference]: Without dead ends: 38 [2022-01-31 18:39:45,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-01-31 18:39:45,400 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:39:45,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:39:45,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-31 18:39:45,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-01-31 18:39:45,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:39:45,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-01-31 18:39:45,408 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 52 [2022-01-31 18:39:45,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:39:45,409 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-01-31 18:39:45,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:45,409 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-01-31 18:39:45,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 18:39:45,411 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:39:45,411 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:39:45,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 18:39:45,412 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:39:45,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:39:45,412 INFO L85 PathProgramCache]: Analyzing trace with hash -417788130, now seen corresponding path program 3 times [2022-01-31 18:39:45,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:39:45,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [786434504] [2022-01-31 18:39:45,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:39:45,416 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:39:45,416 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:39:45,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:39:45,418 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:39:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:45,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:39:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:45,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 18:39:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:45,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-31 18:39:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:45,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 18:39:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:45,524 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:39:45,525 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:39:45,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [786434504] [2022-01-31 18:39:45,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [786434504] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:39:45,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:39:45,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 18:39:45,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92283065] [2022-01-31 18:39:45,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:39:45,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 18:39:45,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:39:45,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 18:39:45,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-31 18:39:45,527 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:45,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:39:45,638 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-01-31 18:39:45,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 18:39:45,638 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2022-01-31 18:39:45,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:39:45,640 INFO L225 Difference]: With dead ends: 64 [2022-01-31 18:39:45,640 INFO L226 Difference]: Without dead ends: 40 [2022-01-31 18:39:45,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-01-31 18:39:45,643 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:39:45,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 42 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:39:45,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-31 18:39:45,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-01-31 18:39:45,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:39:45,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-01-31 18:39:45,658 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2022-01-31 18:39:45,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:39:45,658 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-01-31 18:39:45,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:45,659 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-01-31 18:39:45,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 18:39:45,659 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:39:45,659 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:39:45,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 18:39:45,660 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:39:45,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:39:45,660 INFO L85 PathProgramCache]: Analyzing trace with hash -968514304, now seen corresponding path program 4 times [2022-01-31 18:39:45,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:39:45,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [873884723] [2022-01-31 18:39:45,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:39:45,663 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:39:45,663 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:39:45,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:39:45,664 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:39:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:45,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:39:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:45,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 18:39:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:45,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-31 18:39:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:45,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 18:39:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:45,759 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:39:45,759 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:39:45,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [873884723] [2022-01-31 18:39:45,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [873884723] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:39:45,759 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:39:45,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 18:39:45,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684838091] [2022-01-31 18:39:45,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:39:45,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 18:39:45,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:39:45,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 18:39:45,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-31 18:39:45,761 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:45,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:39:45,870 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-01-31 18:39:45,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 18:39:45,871 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2022-01-31 18:39:45,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:39:45,871 INFO L225 Difference]: With dead ends: 65 [2022-01-31 18:39:45,871 INFO L226 Difference]: Without dead ends: 41 [2022-01-31 18:39:45,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-01-31 18:39:45,872 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:39:45,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 37 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:39:45,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-31 18:39:45,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-01-31 18:39:45,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:39:45,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-01-31 18:39:45,878 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 56 [2022-01-31 18:39:45,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:39:45,878 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-01-31 18:39:45,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:45,879 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-01-31 18:39:45,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 18:39:45,879 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:39:45,879 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:39:45,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 18:39:45,880 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:39:45,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:39:45,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1935390110, now seen corresponding path program 5 times [2022-01-31 18:39:45,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:39:45,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [988149982] [2022-01-31 18:39:45,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:39:45,882 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:39:45,883 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:39:45,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:39:45,885 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:39:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:45,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:39:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:45,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 18:39:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:45,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-01-31 18:39:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:45,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-31 18:39:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-31 18:39:45,960 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:39:45,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [988149982] [2022-01-31 18:39:45,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [988149982] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:39:45,960 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:39:45,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 18:39:45,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026410501] [2022-01-31 18:39:45,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:39:45,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 18:39:45,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:39:45,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 18:39:45,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 18:39:45,961 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:46,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:39:46,030 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2022-01-31 18:39:46,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 18:39:46,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2022-01-31 18:39:46,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:39:46,031 INFO L225 Difference]: With dead ends: 67 [2022-01-31 18:39:46,032 INFO L226 Difference]: Without dead ends: 44 [2022-01-31 18:39:46,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-01-31 18:39:46,033 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:39:46,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:39:46,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-31 18:39:46,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-01-31 18:39:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:39:46,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-01-31 18:39:46,038 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 58 [2022-01-31 18:39:46,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:39:46,038 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-01-31 18:39:46,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:46,038 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-01-31 18:39:46,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-31 18:39:46,039 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:39:46,039 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:39:46,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 18:39:46,040 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:39:46,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:39:46,040 INFO L85 PathProgramCache]: Analyzing trace with hash -709345408, now seen corresponding path program 6 times [2022-01-31 18:39:46,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:39:46,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1763842790] [2022-01-31 18:39:46,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:39:46,042 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:39:46,042 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:39:46,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:39:46,044 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:39:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:46,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:39:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:46,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 18:39:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:46,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 18:39:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:46,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 18:39:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-31 18:39:46,134 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:39:46,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1763842790] [2022-01-31 18:39:46,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1763842790] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:39:46,134 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:39:46,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 18:39:46,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025348884] [2022-01-31 18:39:46,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:39:46,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 18:39:46,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:39:46,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 18:39:46,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-31 18:39:46,136 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:46,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:39:46,220 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2022-01-31 18:39:46,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 18:39:46,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 64 [2022-01-31 18:39:46,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:39:46,221 INFO L225 Difference]: With dead ends: 71 [2022-01-31 18:39:46,222 INFO L226 Difference]: Without dead ends: 46 [2022-01-31 18:39:46,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-01-31 18:39:46,223 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:39:46,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 42 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:39:46,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-31 18:39:46,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-01-31 18:39:46,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:39:46,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-01-31 18:39:46,239 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 64 [2022-01-31 18:39:46,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:39:46,240 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-01-31 18:39:46,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:46,240 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-01-31 18:39:46,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-31 18:39:46,240 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:39:46,240 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:39:46,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 18:39:46,241 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:39:46,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:39:46,241 INFO L85 PathProgramCache]: Analyzing trace with hash -617044450, now seen corresponding path program 7 times [2022-01-31 18:39:46,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:39:46,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1594221356] [2022-01-31 18:39:46,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:39:46,244 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:39:46,244 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:39:46,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:39:46,246 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:39:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:46,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:39:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:46,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 18:39:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:46,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 18:39:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:46,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-31 18:39:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:46,350 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 18:39:46,350 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:39:46,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1594221356] [2022-01-31 18:39:46,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1594221356] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:39:46,350 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:39:46,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 18:39:46,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805644448] [2022-01-31 18:39:46,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:39:46,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 18:39:46,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:39:46,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 18:39:46,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-31 18:39:46,351 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:46,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:39:46,443 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2022-01-31 18:39:46,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 18:39:46,444 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 70 [2022-01-31 18:39:46,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:39:46,445 INFO L225 Difference]: With dead ends: 74 [2022-01-31 18:39:46,445 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 18:39:46,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-01-31 18:39:46,446 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:39:46,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 42 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:39:46,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 18:39:46,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-01-31 18:39:46,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:39:46,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-01-31 18:39:46,451 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 70 [2022-01-31 18:39:46,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:39:46,452 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-01-31 18:39:46,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:46,452 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-01-31 18:39:46,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-01-31 18:39:46,457 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:39:46,457 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:39:46,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 18:39:46,457 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:39:46,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:39:46,457 INFO L85 PathProgramCache]: Analyzing trace with hash 509206076, now seen corresponding path program 8 times [2022-01-31 18:39:46,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:39:46,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [68990198] [2022-01-31 18:39:46,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:39:46,460 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:39:46,460 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:39:46,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:39:46,461 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:39:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:46,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:39:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:46,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 18:39:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:46,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 18:39:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:46,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-01-31 18:39:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:46,538 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-31 18:39:46,538 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:39:46,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [68990198] [2022-01-31 18:39:46,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [68990198] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:39:46,539 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:39:46,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 18:39:46,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822478056] [2022-01-31 18:39:46,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:39:46,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 18:39:46,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:39:46,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 18:39:46,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 18:39:46,540 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:46,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:39:46,602 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-01-31 18:39:46,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 18:39:46,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 76 [2022-01-31 18:39:46,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:39:46,603 INFO L225 Difference]: With dead ends: 71 [2022-01-31 18:39:46,604 INFO L226 Difference]: Without dead ends: 50 [2022-01-31 18:39:46,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-01-31 18:39:46,604 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:39:46,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 37 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:39:46,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-31 18:39:46,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-01-31 18:39:46,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:39:46,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-01-31 18:39:46,610 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 76 [2022-01-31 18:39:46,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:39:46,611 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-01-31 18:39:46,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:46,611 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-01-31 18:39:46,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-01-31 18:39:46,611 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:39:46,611 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:39:46,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 18:39:46,612 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:39:46,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:39:46,612 INFO L85 PathProgramCache]: Analyzing trace with hash 366824890, now seen corresponding path program 9 times [2022-01-31 18:39:46,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:39:46,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [322186929] [2022-01-31 18:39:46,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:39:46,615 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:39:46,616 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:39:46,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:39:46,617 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:39:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:46,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:39:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:46,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 18:39:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:46,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 18:39:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:46,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 18:39:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-31 18:39:46,695 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:39:46,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [322186929] [2022-01-31 18:39:46,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [322186929] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:39:46,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:39:46,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 18:39:46,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480299560] [2022-01-31 18:39:46,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:39:46,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 18:39:46,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:39:46,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 18:39:46,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-31 18:39:46,696 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:46,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:39:46,776 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-01-31 18:39:46,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 18:39:46,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 78 [2022-01-31 18:39:46,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:39:46,777 INFO L225 Difference]: With dead ends: 72 [2022-01-31 18:39:46,777 INFO L226 Difference]: Without dead ends: 51 [2022-01-31 18:39:46,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-01-31 18:39:46,779 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 26 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:39:46,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 42 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:39:46,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-31 18:39:46,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-01-31 18:39:46,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:39:46,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-01-31 18:39:46,785 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 78 [2022-01-31 18:39:46,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:39:46,786 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-01-31 18:39:46,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:39:46,786 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-01-31 18:39:46,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-31 18:39:46,787 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:39:46,787 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:39:46,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 18:39:46,787 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:39:46,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:39:46,787 INFO L85 PathProgramCache]: Analyzing trace with hash 977458616, now seen corresponding path program 10 times [2022-01-31 18:39:46,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:39:46,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1148790445] [2022-01-31 18:39:46,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:39:46,789 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:39:46,789 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:39:46,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:39:46,791 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:39:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:50,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:39:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:50,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 18:39:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:50,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 18:39:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:51,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-31 18:39:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-31 18:39:52,379 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:39:52,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1148790445] [2022-01-31 18:39:52,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1148790445] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:39:52,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:39:52,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-01-31 18:39:52,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932757336] [2022-01-31 18:39:52,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:39:52,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-01-31 18:39:52,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:39:52,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-01-31 18:39:52,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1777, Unknown=0, NotChecked=0, Total=1892 [2022-01-31 18:39:52,382 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 44 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 40 states have internal predecessors, (55), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:39:57,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:39:57,211 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2022-01-31 18:39:57,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-31 18:39:57,212 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 40 states have internal predecessors, (55), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 80 [2022-01-31 18:39:57,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:39:57,214 INFO L225 Difference]: With dead ends: 102 [2022-01-31 18:39:57,214 INFO L226 Difference]: Without dead ends: 77 [2022-01-31 18:39:57,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 16 SyntacticMatches, 8 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=348, Invalid=5352, Unknown=0, NotChecked=0, Total=5700 [2022-01-31 18:39:57,217 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 61 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1939 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 2019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-31 18:39:57,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 138 Invalid, 2019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1939 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-31 18:39:57,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-01-31 18:39:57,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2022-01-31 18:39:57,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 60 states have internal predecessors, (63), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-01-31 18:39:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-01-31 18:39:57,233 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 80 [2022-01-31 18:39:57,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:39:57,233 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-01-31 18:39:57,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 40 states have internal predecessors, (55), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:39:57,233 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-01-31 18:39:57,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-31 18:39:57,234 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:39:57,234 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:39:57,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 18:39:57,235 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:39:57,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:39:57,235 INFO L85 PathProgramCache]: Analyzing trace with hash 6947350, now seen corresponding path program 11 times [2022-01-31 18:39:57,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:39:57,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1005516826] [2022-01-31 18:39:57,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:39:57,237 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:39:57,237 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:39:57,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:39:57,239 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:39:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:57,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:39:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:57,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 18:39:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:57,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 18:39:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:57,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-31 18:39:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:39:57,315 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-31 18:39:57,315 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:39:57,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1005516826] [2022-01-31 18:39:57,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1005516826] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:39:57,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:39:57,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 18:39:57,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726909637] [2022-01-31 18:39:57,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:39:57,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 18:39:57,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:39:57,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 18:39:57,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-01-31 18:39:57,317 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 18:39:57,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:39:57,413 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2022-01-31 18:39:57,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 18:39:57,413 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 82 [2022-01-31 18:39:57,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:39:57,414 INFO L225 Difference]: With dead ends: 85 [2022-01-31 18:39:57,414 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 18:39:57,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-01-31 18:39:57,415 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:39:57,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 33 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:39:57,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 18:39:57,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 18:39:57,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-31 18:39:57,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 18:39:57,416 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2022-01-31 18:39:57,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:39:57,417 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 18:39:57,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 18:39:57,417 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 18:39:57,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 18:39:57,419 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 18:39:57,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 18:39:57,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 18:40:00,067 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-01-31 18:40:00,067 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-01-31 18:40:00,067 INFO L858 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-01-31 18:40:00,067 INFO L854 garLoopResultBuilder]: At program point sumEXIT(lines 15 24) the Hoare annotation is: (let ((.cse11 (select |#memory_int| |sum_#in~x.base|))) (let ((.cse8 (select .cse11 (+ |sum_#in~x.offset| 4))) (.cse1 (select .cse11 (+ |sum_#in~x.offset| 12))) (.cse10 (select .cse11 (+ |sum_#in~x.offset| 8))) (.cse9 (select .cse11 |sum_#in~x.offset|)) (.cse7 (select .cse11 (+ 16 |sum_#in~x.offset|)))) (let ((.cse2 (* (- 1) .cse7)) (.cse3 (* (- 1) .cse9)) (.cse4 (* (- 1) .cse10)) (.cse5 (* (- 1) .cse1)) (.cse6 (* (- 1) .cse8)) (.cse0 (+ .cse1 .cse7 .cse8 .cse9 .cse10))) (and (<= .cse0 sum_~ret~0) (<= 5 sum_~i~0) (<= (+ .cse1 (* (div (+ .cse2 |sum_#res| 4294967295 .cse3 .cse4 .cse5 .cse6) 4294967296) 4294967296) .cse7 .cse8 .cse9 .cse10) 2147483647) (<= 2147483648 (+ (* (div (+ .cse2 |sum_#res| .cse3 .cse4 .cse5 4294967296 .cse6) 4294967296) 4294967296) .cse1 .cse7 .cse8 .cse9 .cse10)) (<= sum_~ret~0 .cse0))))) [2022-01-31 18:40:00,067 INFO L861 garLoopResultBuilder]: At program point sumENTRY(lines 15 24) the Hoare annotation is: true [2022-01-31 18:40:00,067 INFO L854 garLoopResultBuilder]: At program point L20-2(lines 20 22) the Hoare annotation is: (let ((.cse3 (select |#memory_int| sum_~x.base))) (let ((.cse1 (= sum_~x.offset |sum_#in~x.offset|)) (.cse2 (= |sum_#in~x.base| sum_~x.base)) (.cse4 (select .cse3 (+ sum_~x.offset (* sum_~i~0 4)))) (.cse5 (select .cse3 (+ sum_~x.offset 4))) (.cse6 (select .cse3 |sum_#in~x.offset|))) (or (let ((.cse0 (+ (select .cse3 (+ sum_~x.offset 8)) .cse4 .cse5 .cse6))) (and (<= sum_~i~0 3) (<= .cse0 sum_~ret~0) .cse1 .cse2 (<= 3 sum_~i~0) (<= sum_~ret~0 .cse0))) (let ((.cse7 (+ .cse4 .cse6))) (and (<= sum_~ret~0 .cse7) .cse1 (<= .cse7 sum_~ret~0) (<= sum_~i~0 1) .cse2 (<= 1 sum_~i~0))) (and (<= .cse4 sum_~ret~0) .cse1 .cse2 (<= sum_~ret~0 .cse4) (<= sum_~i~0 0) (<= 0 sum_~i~0)) (let ((.cse8 (let ((.cse9 (select |#memory_int| |sum_#in~x.base|))) (+ (select .cse9 (+ |sum_#in~x.offset| 12)) (select .cse9 (+ 16 |sum_#in~x.offset|)) (select .cse9 (+ |sum_#in~x.offset| 4)) (select .cse9 |sum_#in~x.offset|) (select .cse9 (+ |sum_#in~x.offset| 8)))))) (and (<= .cse8 sum_~ret~0) (<= 4 sum_~i~0) (<= sum_~ret~0 .cse8) (<= sum_~i~0 4))) (let ((.cse10 (+ .cse4 .cse5 .cse6))) (and (<= sum_~ret~0 .cse10) (<= sum_~i~0 2) (<= 2 sum_~i~0) .cse1 .cse2 (<= .cse10 sum_~ret~0)))))) [2022-01-31 18:40:00,068 INFO L854 garLoopResultBuilder]: At program point L20-3(lines 20 22) the Hoare annotation is: (let ((.cse7 (select |#memory_int| sum_~x.base))) (let ((.cse4 (select .cse7 (+ sum_~x.offset 8))) (.cse1 (= sum_~x.offset |sum_#in~x.offset|)) (.cse2 (= |sum_#in~x.base| sum_~x.base)) (.cse5 (select .cse7 (+ sum_~x.offset 4))) (.cse0 (select .cse7 |sum_#in~x.offset|))) (or (and (<= sum_~ret~0 .cse0) .cse1 (<= sum_~i~0 1) .cse2 (<= 1 sum_~i~0) (<= .cse0 sum_~ret~0)) (let ((.cse3 (+ .cse4 .cse5 .cse0))) (and (<= sum_~i~0 3) (<= .cse3 sum_~ret~0) .cse1 .cse2 (<= 3 sum_~i~0) (<= sum_~ret~0 .cse3))) (let ((.cse6 (+ .cse4 .cse5 .cse0 (select .cse7 (+ sum_~x.offset 12))))) (and .cse1 .cse2 (<= 4 sum_~i~0) (<= sum_~ret~0 .cse6) (<= .cse6 sum_~ret~0) (<= sum_~i~0 4))) (and .cse1 (<= sum_~ret~0 0) .cse2 (<= 0 sum_~ret~0) (<= sum_~i~0 0) (<= 0 sum_~i~0)) (let ((.cse8 (let ((.cse9 (select |#memory_int| |sum_#in~x.base|))) (+ (select .cse9 (+ |sum_#in~x.offset| 12)) (select .cse9 (+ 16 |sum_#in~x.offset|)) (select .cse9 (+ |sum_#in~x.offset| 4)) (select .cse9 |sum_#in~x.offset|) (select .cse9 (+ |sum_#in~x.offset| 8)))))) (and (<= .cse8 sum_~ret~0) (<= 5 sum_~i~0) (<= sum_~ret~0 .cse8))) (let ((.cse10 (+ .cse5 .cse0))) (and (<= sum_~i~0 2) (<= .cse10 sum_~ret~0) (<= 2 sum_~i~0) .cse1 (<= sum_~ret~0 .cse10) .cse2))))) [2022-01-31 18:40:00,068 INFO L854 garLoopResultBuilder]: At program point L20-4(lines 20 22) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (select |#memory_int| |sum_#in~x.base|))) (+ (select .cse1 (+ |sum_#in~x.offset| 12)) (select .cse1 (+ 16 |sum_#in~x.offset|)) (select .cse1 (+ |sum_#in~x.offset| 4)) (select .cse1 |sum_#in~x.offset|) (select .cse1 (+ |sum_#in~x.offset| 8)))))) (and (<= .cse0 sum_~ret~0) (<= 5 sum_~i~0) (<= sum_~ret~0 .cse0))) [2022-01-31 18:40:00,068 INFO L854 garLoopResultBuilder]: At program point sumFINAL(lines 15 24) the Hoare annotation is: (let ((.cse11 (select |#memory_int| |sum_#in~x.base|))) (let ((.cse8 (select .cse11 (+ |sum_#in~x.offset| 4))) (.cse1 (select .cse11 (+ |sum_#in~x.offset| 12))) (.cse10 (select .cse11 (+ |sum_#in~x.offset| 8))) (.cse9 (select .cse11 |sum_#in~x.offset|)) (.cse7 (select .cse11 (+ 16 |sum_#in~x.offset|)))) (let ((.cse2 (* (- 1) .cse7)) (.cse3 (* (- 1) .cse9)) (.cse4 (* (- 1) .cse10)) (.cse5 (* (- 1) .cse1)) (.cse6 (* (- 1) .cse8)) (.cse0 (+ .cse1 .cse7 .cse8 .cse9 .cse10))) (and (<= .cse0 sum_~ret~0) (<= 5 sum_~i~0) (<= (+ .cse1 (* (div (+ .cse2 |sum_#res| 4294967295 .cse3 .cse4 .cse5 .cse6) 4294967296) 4294967296) .cse7 .cse8 .cse9 .cse10) 2147483647) (<= 2147483648 (+ (* (div (+ .cse2 |sum_#res| .cse3 .cse4 .cse5 4294967296 .cse6) 4294967296) 4294967296) .cse1 .cse7 .cse8 .cse9 .cse10)) (<= sum_~ret~0 .cse0))))) [2022-01-31 18:40:00,068 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 26 53) the Hoare annotation is: true [2022-01-31 18:40:00,068 INFO L854 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: false [2022-01-31 18:40:00,068 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 26 53) the Hoare annotation is: true [2022-01-31 18:40:00,068 INFO L854 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (and (= |main_~#x~0.offset| 0) (let ((.cse5 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse0 (select .cse5 (+ |main_~#x~0.offset| 4))) (.cse1 (select .cse5 (+ |main_~#x~0.offset| 16))) (.cse2 (select .cse5 (+ |main_~#x~0.offset| 8))) (.cse3 (select .cse5 (+ |main_~#x~0.offset| 12))) (.cse4 (select .cse5 |main_~#x~0.offset|))) (= (+ .cse0 .cse1 .cse2 .cse3 .cse4) (+ |main_#t~ret5| (* (div (+ .cse0 .cse1 .cse2 .cse3 .cse4 2147483648) 4294967296) 4294967296)))))) [2022-01-31 18:40:00,069 INFO L854 garLoopResultBuilder]: At program point L34-2(lines 34 36) the Hoare annotation is: (and (= |main_~#x~0.offset| 0) (<= main_~i~1 4)) [2022-01-31 18:40:00,069 INFO L854 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) the Hoare annotation is: false [2022-01-31 18:40:00,069 INFO L854 garLoopResultBuilder]: At program point L34-3(lines 34 36) the Hoare annotation is: (= |main_~#x~0.offset| 0) [2022-01-31 18:40:00,069 INFO L854 garLoopResultBuilder]: At program point L34-4(lines 34 36) the Hoare annotation is: (= |main_~#x~0.offset| 0) [2022-01-31 18:40:00,069 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 26 53) the Hoare annotation is: true [2022-01-31 18:40:00,069 INFO L854 garLoopResultBuilder]: At program point L49(lines 49 51) the Hoare annotation is: (let ((.cse3 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse2 (select .cse3 (+ |main_~#x~0.offset| 4))) (.cse4 (select .cse3 (+ |main_~#x~0.offset| 8))) (.cse5 (select .cse3 (+ |main_~#x~0.offset| 12))) (.cse6 (select .cse3 0))) (and (= |main_~#x~0.offset| 0) (= (* main_~i~2 4) 16) (let ((.cse1 (+ .cse2 (select .cse3 (+ |main_~#x~0.offset| 16)) .cse4 .cse5 .cse6))) (let ((.cse0 (* (div .cse1 4294967296) 4294967296))) (or (= (+ main_~ret~1 .cse0 4294967296) .cse1) (= (+ main_~ret~1 .cse0) .cse1)))) (= main_~ret~1 main_~ret5~0) (let ((.cse7 (+ .cse2 main_~temp~0 .cse4 .cse5 .cse6))) (let ((.cse8 (* (div .cse7 4294967296) 4294967296))) (or (and (= .cse7 (+ main_~ret~1 .cse8)) (<= (* (div (+ .cse2 main_~temp~0 .cse4 .cse5 .cse6 2147483648) 4294967296) 4294967296) .cse7)) (and (= (+ main_~ret~1 4294967296 .cse8) .cse7) (<= .cse8 (* (div (+ (- 2147483648) .cse2 main_~temp~0 .cse4 .cse5 .cse6) 4294967296) 4294967296)))))) (= main_~ret~1 main_~ret2~0)))) [2022-01-31 18:40:00,069 INFO L854 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse9 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse2 (select .cse9 (+ |main_~#x~0.offset| 4))) (.cse3 (select .cse9 (+ |main_~#x~0.offset| 8))) (.cse4 (select .cse9 (+ |main_~#x~0.offset| 12))) (.cse5 (select .cse9 0))) (and (let ((.cse0 (+ .cse2 main_~temp~0 .cse3 .cse4 .cse5))) (let ((.cse1 (* (div .cse0 4294967296) 4294967296)) (.cse6 (= main_~ret~1 main_~ret2~0))) (or (and (= .cse0 (+ main_~ret~1 .cse1)) (<= (* (div (+ .cse2 main_~temp~0 .cse3 .cse4 .cse5 2147483648) 4294967296) 4294967296) .cse0) .cse6) (and (= (+ main_~ret~1 4294967296 .cse1) .cse0) (<= .cse1 (* (div (+ (- 2147483648) .cse2 main_~temp~0 .cse3 .cse4 .cse5) 4294967296) 4294967296)) .cse6)))) (= |main_~#x~0.offset| 0) (= (* main_~i~2 4) 16) (let ((.cse8 (+ .cse2 (select .cse9 (+ |main_~#x~0.offset| 16)) .cse3 .cse4 .cse5))) (let ((.cse7 (* (div .cse8 4294967296) 4294967296))) (or (= (+ main_~ret~1 .cse7 4294967296) .cse8) (= (+ main_~ret~1 .cse7) .cse8))))))) [2022-01-31 18:40:00,070 INFO L861 garLoopResultBuilder]: At program point L49-2(lines 49 51) the Hoare annotation is: true [2022-01-31 18:40:00,070 INFO L854 garLoopResultBuilder]: At program point L47-1(line 47) the Hoare annotation is: (let ((.cse3 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse2 (select .cse3 (+ |main_~#x~0.offset| 4))) (.cse4 (select .cse3 (+ |main_~#x~0.offset| 8))) (.cse5 (select .cse3 (+ |main_~#x~0.offset| 12))) (.cse6 (select .cse3 0))) (and (= |main_#t~ret12| main_~ret~1) (= |main_~#x~0.offset| 0) (= (* main_~i~2 4) 16) (let ((.cse1 (+ .cse2 (select .cse3 (+ |main_~#x~0.offset| 16)) .cse4 .cse5 .cse6))) (let ((.cse0 (* (div .cse1 4294967296) 4294967296))) (or (= (+ main_~ret~1 .cse0 4294967296) .cse1) (= (+ main_~ret~1 .cse0) .cse1)))) (let ((.cse7 (+ .cse2 main_~temp~0 .cse4 .cse5 .cse6))) (let ((.cse8 (* (div .cse7 4294967296) 4294967296))) (or (and (= .cse7 (+ main_~ret~1 .cse8)) (<= (* (div (+ .cse2 main_~temp~0 .cse4 .cse5 .cse6 2147483648) 4294967296) 4294967296) .cse7)) (and (= (+ main_~ret~1 4294967296 .cse8) .cse7) (<= .cse8 (* (div (+ (- 2147483648) .cse2 main_~temp~0 .cse4 .cse5 .cse6) 4294967296) 4294967296)))))) (= main_~ret~1 main_~ret2~0)))) [2022-01-31 18:40:00,070 INFO L854 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (= |main_~#x~0.offset| 0) (let ((.cse5 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse0 (select .cse5 (+ |main_~#x~0.offset| 4))) (.cse1 (select .cse5 (+ |main_~#x~0.offset| 16))) (.cse2 (select .cse5 (+ |main_~#x~0.offset| 8))) (.cse3 (select .cse5 (+ |main_~#x~0.offset| 12))) (.cse4 (select .cse5 |main_~#x~0.offset|))) (= (+ .cse0 .cse1 .cse2 .cse3 .cse4) (+ main_~ret~1 4294967296 (* (div (+ (- 2147483648) .cse0 .cse1 .cse2 .cse3 .cse4) 4294967296) 4294967296)))))) [2022-01-31 18:40:00,070 INFO L854 garLoopResultBuilder]: At program point L43-2(lines 43 45) the Hoare annotation is: (let ((.cse0 (* main_~i~2 4)) (.cse18 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse4 (select .cse18 (+ |main_~#x~0.offset| 16))) (.cse7 (= main_~ret~1 main_~ret2~0)) (.cse3 (select .cse18 (+ |main_~#x~0.offset| .cse0))) (.cse8 (= |main_~#x~0.offset| 0)) (.cse2 (select .cse18 (+ |main_~#x~0.offset| 4))) (.cse11 (select .cse18 (+ |main_~#x~0.offset| .cse0 4))) (.cse13 (select .cse18 (+ |main_~#x~0.offset| 8))) (.cse5 (select .cse18 0))) (or (and (= .cse0 8) (let ((.cse6 (+ .cse2 .cse3 .cse4 main_~temp~0 .cse5))) (let ((.cse1 (* 4294967296 (div .cse6 4294967296)))) (or (and (<= .cse1 (* (div (+ (- 2147483648) .cse2 .cse3 .cse4 main_~temp~0 .cse5) 4294967296) 4294967296)) (= .cse6 (+ main_~ret~1 4294967296 .cse1)) .cse7) (and (<= (* (div (+ .cse2 .cse3 .cse4 main_~temp~0 .cse5 2147483648) 4294967296) 4294967296) .cse6) (= .cse6 (+ main_~ret~1 .cse1)) .cse7)))) .cse8 (let ((.cse10 (+ .cse2 .cse4 .cse11 main_~temp~0 .cse5))) (let ((.cse9 (* (div .cse10 4294967296) 4294967296))) (or (= (+ .cse9 main_~ret~1 4294967296) .cse10) (= .cse10 (+ .cse9 main_~ret~1)))))) (let ((.cse14 (select .cse18 (+ |main_~#x~0.offset| 12)))) (and .cse8 (let ((.cse12 (+ .cse3 .cse4 main_~temp~0 .cse13 .cse14))) (let ((.cse15 (* (div .cse12 4294967296) 4294967296))) (or (and (<= .cse12 (+ (* (div (+ (- 2147483648) .cse3 .cse4 main_~temp~0 .cse13 .cse14) 4294967296) 4294967296) 4294967295)) (= .cse12 (+ main_~ret~1 .cse15 4294967296)) .cse7) (and (<= (* (div (+ .cse3 .cse4 main_~temp~0 .cse13 .cse14 2147483648) 4294967296) 4294967296) .cse12) (= (+ main_~ret~1 .cse15) .cse12) .cse7)))) (= main_~i~2 0) (let ((.cse16 (+ .cse4 .cse11 main_~temp~0 .cse13 .cse14))) (let ((.cse17 (* (div .cse16 4294967296) 4294967296))) (or (= .cse16 (+ .cse17 main_~ret~1 4294967296)) (= .cse16 (+ .cse17 main_~ret~1))))))) (let ((.cse21 (select .cse18 (+ |main_~#x~0.offset| .cse0 8)))) (and (let ((.cse19 (+ .cse4 .cse11 main_~temp~0 .cse21 .cse5))) (let ((.cse20 (* (div .cse19 4294967296) 4294967296))) (or (and (= .cse19 (+ main_~ret~1 .cse20 4294967296)) (<= .cse19 (+ 4294967295 (* (div (+ (- 2147483648) .cse4 .cse11 main_~temp~0 .cse21 .cse5) 4294967296) 4294967296))) .cse7) (and (= .cse19 (+ main_~ret~1 .cse20)) (<= (* (div (+ .cse4 .cse11 main_~temp~0 .cse21 .cse5 2147483648) 4294967296) 4294967296) .cse19) .cse7)))) (let ((.cse23 (+ .cse3 .cse4 main_~temp~0 .cse21 .cse5))) (let ((.cse22 (* (div .cse23 4294967296) 4294967296))) (or (= (+ main_~ret~1 .cse22) .cse23) (= (+ main_~ret~1 .cse22 4294967296) .cse23)))) .cse8 (= .cse0 4))) (and (let ((.cse25 (+ .cse2 .cse3 main_~temp~0 .cse13 .cse5))) (let ((.cse24 (* (div .cse25 4294967296) 4294967296))) (or (and (= (+ main_~ret~1 .cse24) .cse25) (<= (* (div (+ .cse2 .cse3 main_~temp~0 .cse13 .cse5 2147483648) 4294967296) 4294967296) .cse25) .cse7) (and (= (+ main_~ret~1 .cse24 4294967296) .cse25) (<= .cse25 (+ (* (div (+ (- 2147483648) .cse2 .cse3 main_~temp~0 .cse13 .cse5) 4294967296) 4294967296) 4294967295)) .cse7)))) (= .cse0 12) .cse8 (let ((.cse26 (+ .cse2 .cse11 main_~temp~0 .cse13 .cse5))) (let ((.cse27 (* (div .cse26 4294967296) 4294967296))) (or (= .cse26 (+ main_~ret~1 .cse27)) (= .cse26 (+ main_~ret~1 .cse27 4294967296))))))))) [2022-01-31 18:40:00,071 INFO L854 garLoopResultBuilder]: At program point L41-1(line 41) the Hoare annotation is: (and (let ((.cse10 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse1 (select .cse10 (+ |main_~#x~0.offset| 4))) (.cse2 (select .cse10 (+ |main_~#x~0.offset| 16))) (.cse3 (select .cse10 (+ |main_~#x~0.offset| 8))) (.cse4 (select .cse10 (+ |main_~#x~0.offset| 12))) (.cse5 (select .cse10 |main_~#x~0.offset|))) (let ((.cse8 (+ .cse1 .cse2 .cse3 .cse4 .cse5))) (let ((.cse9 (div .cse8 4294967296))) (let ((.cse7 (= main_~ret~1 |main_#t~ret8|)) (.cse0 (* .cse9 (- 4294967296)))) (or (let ((.cse6 (* .cse9 4294967296))) (and (= main_~ret~1 (+ .cse0 .cse1 .cse2 .cse3 .cse4 (- 4294967296) .cse5)) (<= .cse6 (* (div (+ (- 2147483648) .cse1 .cse2 .cse3 .cse4 .cse5) 4294967296) 4294967296)) (or .cse7 (<= (+ .cse6 8589934592 |main_#t~ret8|) .cse8)))) (and (<= (* (div (+ .cse1 .cse2 .cse3 .cse4 .cse5 2147483648) 4294967296) 4294967296) .cse8) .cse7 (= main_~ret~1 (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))))))))) (= |main_~#x~0.offset| 0)) [2022-01-31 18:40:00,071 INFO L854 garLoopResultBuilder]: At program point L43-3(lines 43 45) the Hoare annotation is: (let ((.cse14 (* main_~i~2 4)) (.cse20 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse5 (select .cse20 (+ |main_~#x~0.offset| 12))) (.cse2 (select .cse20 (+ |main_~#x~0.offset| 16))) (.cse7 (= |main_~#x~0.offset| 0)) (.cse6 (= main_~ret~1 main_~ret2~0)) (.cse10 (select .cse20 (+ |main_~#x~0.offset| 4))) (.cse3 (select .cse20 (+ |main_~#x~0.offset| .cse14 4))) (.cse4 (select .cse20 (+ |main_~#x~0.offset| 8))) (.cse11 (select .cse20 0))) (or (and (let ((.cse0 (+ .cse2 .cse3 main_~temp~0 .cse4 .cse5))) (let ((.cse1 (* (div .cse0 4294967296) 4294967296))) (or (and (= .cse0 (+ .cse1 main_~ret~1 4294967296)) (<= .cse1 (* (div (+ (- 2147483648) .cse2 .cse3 main_~temp~0 .cse4 .cse5) 4294967296) 4294967296)) .cse6) (and (<= (* (div (+ .cse2 .cse3 main_~temp~0 .cse4 .cse5 2147483648) 4294967296) 4294967296) .cse0) (= .cse0 (+ .cse1 main_~ret~1)) .cse6)))) .cse7 (let ((.cse9 (+ .cse10 .cse2 .cse4 .cse5 .cse11))) (let ((.cse8 (* (div .cse9 4294967296) 4294967296))) (or (= (+ main_~ret~1 .cse8 4294967296) .cse9) (= (+ main_~ret~1 .cse8) .cse9)))) (= main_~i~2 0)) (and (let ((.cse12 (+ .cse10 main_~temp~0 .cse4 .cse5 .cse11))) (let ((.cse13 (* (div .cse12 4294967296) 4294967296))) (or (and (= .cse12 (+ main_~ret~1 .cse13)) (<= (* (div (+ .cse10 main_~temp~0 .cse4 .cse5 .cse11 2147483648) 4294967296) 4294967296) .cse12) .cse6) (and (= (+ main_~ret~1 4294967296 .cse13) .cse12) (<= .cse13 (* (div (+ (- 2147483648) .cse10 main_~temp~0 .cse4 .cse5 .cse11) 4294967296) 4294967296)) .cse6)))) .cse7 (= .cse14 16)) (and (let ((.cse15 (+ .cse10 .cse2 .cse3 main_~temp~0 .cse11))) (let ((.cse16 (* (div .cse15 4294967296) 4294967296))) (or (and (<= (* (div (+ .cse10 .cse2 .cse3 main_~temp~0 .cse11 2147483648) 4294967296) 4294967296) .cse15) (= .cse15 (+ .cse16 main_~ret~1)) .cse6) (and (= (+ .cse16 main_~ret~1 4294967296) .cse15) (<= .cse15 (+ 4294967295 (* (div (+ (- 2147483648) .cse10 .cse2 .cse3 main_~temp~0 .cse11) 4294967296) 4294967296))) .cse6)))) (= .cse14 8) .cse7) (and (let ((.cse19 (select .cse20 (+ |main_~#x~0.offset| .cse14 8)))) (let ((.cse17 (+ .cse2 .cse3 main_~temp~0 .cse19 .cse11))) (let ((.cse18 (* (div .cse17 4294967296) 4294967296))) (or (and (= .cse17 (+ main_~ret~1 .cse18 4294967296)) (<= .cse17 (+ 4294967295 (* (div (+ (- 2147483648) .cse2 .cse3 main_~temp~0 .cse19 .cse11) 4294967296) 4294967296))) .cse6) (and (= .cse17 (+ main_~ret~1 .cse18)) (<= (* (div (+ .cse2 .cse3 main_~temp~0 .cse19 .cse11 2147483648) 4294967296) 4294967296) .cse17) .cse6))))) .cse7 (= .cse14 4)) (and (= .cse14 12) .cse7 (let ((.cse21 (+ .cse10 .cse3 main_~temp~0 .cse4 .cse11))) (let ((.cse22 (* (div .cse21 4294967296) 4294967296))) (or (and (= .cse21 (+ main_~ret~1 .cse22 4294967296)) (<= .cse22 (* 4294967296 (div (+ (- 2147483648) .cse10 .cse3 main_~temp~0 .cse4 .cse11) 4294967296))) .cse6) (and (= .cse21 (+ main_~ret~1 .cse22)) (<= (* (div (+ .cse10 .cse3 main_~temp~0 .cse4 .cse11 2147483648) 4294967296) 4294967296) .cse21) .cse6)))))))) [2022-01-31 18:40:00,071 INFO L854 garLoopResultBuilder]: At program point L43-4(lines 43 45) the Hoare annotation is: (and (let ((.cse7 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse2 (select .cse7 (+ |main_~#x~0.offset| 4))) (.cse3 (select .cse7 (+ |main_~#x~0.offset| 8))) (.cse4 (select .cse7 (+ |main_~#x~0.offset| 12))) (.cse5 (select .cse7 0))) (let ((.cse0 (+ .cse2 main_~temp~0 .cse3 .cse4 .cse5))) (let ((.cse1 (* (div .cse0 4294967296) 4294967296)) (.cse6 (= main_~ret~1 main_~ret2~0))) (or (and (= .cse0 (+ main_~ret~1 .cse1)) (<= (* (div (+ .cse2 main_~temp~0 .cse3 .cse4 .cse5 2147483648) 4294967296) 4294967296) .cse0) .cse6) (and (= (+ main_~ret~1 4294967296 .cse1) .cse0) (<= .cse1 (* (div (+ (- 2147483648) .cse2 main_~temp~0 .cse3 .cse4 .cse5) 4294967296) 4294967296)) .cse6)))))) (= |main_~#x~0.offset| 0) (= (* main_~i~2 4) 16)) [2022-01-31 18:40:00,071 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-01-31 18:40:00,071 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-01-31 18:40:00,071 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-01-31 18:40:00,071 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-01-31 18:40:00,071 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-31 18:40:00,072 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 18:40:00,072 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-01-31 18:40:00,074 INFO L732 BasicCegarLoop]: Path program histogram: [11, 3, 1, 1] [2022-01-31 18:40:00,075 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 18:40:00,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 06:40:00 BoogieIcfgContainer [2022-01-31 18:40:00,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 18:40:00,120 INFO L158 Benchmark]: Toolchain (without parser) took 17135.70ms. Allocated memory was 181.4MB in the beginning and 310.4MB in the end (delta: 129.0MB). Free memory was 126.7MB in the beginning and 264.6MB in the end (delta: -137.9MB). Peak memory consumption was 153.8MB. Max. memory is 8.0GB. [2022-01-31 18:40:00,120 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 181.4MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 18:40:00,121 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.51ms. Allocated memory is still 181.4MB. Free memory was 126.6MB in the beginning and 152.7MB in the end (delta: -26.1MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-01-31 18:40:00,121 INFO L158 Benchmark]: Boogie Preprocessor took 21.92ms. Allocated memory is still 181.4MB. Free memory was 152.7MB in the beginning and 151.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-31 18:40:00,121 INFO L158 Benchmark]: RCFGBuilder took 240.19ms. Allocated memory is still 181.4MB. Free memory was 151.1MB in the beginning and 139.0MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-31 18:40:00,121 INFO L158 Benchmark]: TraceAbstraction took 16649.20ms. Allocated memory was 181.4MB in the beginning and 310.4MB in the end (delta: 129.0MB). Free memory was 138.5MB in the beginning and 264.6MB in the end (delta: -126.1MB). Peak memory consumption was 165.9MB. Max. memory is 8.0GB. [2022-01-31 18:40:00,122 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 181.4MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.51ms. Allocated memory is still 181.4MB. Free memory was 126.6MB in the beginning and 152.7MB in the end (delta: -26.1MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.92ms. Allocated memory is still 181.4MB. Free memory was 152.7MB in the beginning and 151.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 240.19ms. Allocated memory is still 181.4MB. Free memory was 151.1MB in the beginning and 139.0MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 16649.20ms. Allocated memory was 181.4MB in the beginning and 310.4MB in the end (delta: 129.0MB). Free memory was 138.5MB in the beginning and 264.6MB in the end (delta: -126.1MB). Peak memory consumption was 165.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 50]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.5s, OverallIterations: 16, TraceHistogramMax: 16, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 481 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 437 mSDsluCounter, 685 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 288 mSDsCounter, 201 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2727 IncrementalHoareTripleChecker+Invalid, 2928 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 201 mSolverCounterUnsat, 397 mSDtfsCounter, 2727 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 346 GetRequests, 157 SyntacticMatches, 8 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=15, InterpolantAutomatonStates: 126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 18 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 31 LocationsWithAnnotation, 241 PreInvPairs, 317 NumberOfFragments, 6718 HoareAnnotationTreeSize, 241 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 31 FomulaSimplificationsInter, 1289 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: x == 0 - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: (((((((((unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] == (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296 * 4294967296 + ret + 4294967296 && (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296 * 4294967296 <= (-2147483648 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296 * 4294967296) && ret == ret2) || (((unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + 2147483648) / 4294967296 * 4294967296 <= unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] && unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] == (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296 * 4294967296 + ret) && ret == ret2)) && x == 0) && (ret + (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 4294967296 * 4294967296 + 4294967296 == unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0] || ret + (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 4294967296 * 4294967296 == unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0])) && i == 0) || (((((unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0] == ret + (unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 4294967296 * 4294967296 && (unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0] + 2147483648) / 4294967296 * 4294967296 <= unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) && ret == ret2) || ((ret + 4294967296 + (unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 4294967296 * 4294967296 == unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0] && (unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 4294967296 * 4294967296 <= (-2147483648 + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 4294967296 * 4294967296) && ret == ret2)) && x == 0) && i * 4 == 16)) || ((((((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][0] + 2147483648) / 4294967296 * 4294967296 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][0] && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][0] == (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][0]) / 4294967296 * 4294967296 + ret) && ret == ret2) || (((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][0]) / 4294967296 * 4294967296 + ret + 4294967296 == unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][0] && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][0] <= 4294967295 + (-2147483648 + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][0]) / 4294967296 * 4294967296) && ret == ret2)) && i * 4 == 8) && x == 0)) || (((((unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] == ret + (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 4294967296 * 4294967296 + 4294967296 && unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] <= 4294967295 + (-2147483648 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 4294967296 * 4294967296) && ret == ret2) || ((unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] == ret + (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 4294967296 * 4294967296 && (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] + 2147483648) / 4294967296 * 4294967296 <= unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) && ret == ret2)) && x == 0) && i * 4 == 4)) || ((i * 4 == 12 && x == 0) && (((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0] == ret + (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0]) / 4294967296 * 4294967296 + 4294967296 && (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0]) / 4294967296 * 4294967296 <= 4294967296 * ((-2147483648 + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0]) / 4294967296)) && ret == ret2) || ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0] == ret + (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0]) / 4294967296 * 4294967296 && (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0] + 2147483648) / 4294967296 * 4294967296 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0]) && ret == ret2))) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((((((ret <= unknown-#memory_int-unknown[x][x] && x == x) && i <= 1) && x == x) && 1 <= i) && unknown-#memory_int-unknown[x][x] <= ret) || (((((i <= 3 && unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] <= ret) && x == x) && x == x) && 3 <= i) && ret <= unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x])) || (((((x == x && x == x) && 4 <= i) && ret <= unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 12]) && unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 12] <= ret) && i <= 4)) || (((((x == x && ret <= 0) && x == x) && 0 <= ret) && i <= 0) && 0 <= i)) || ((unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] <= ret && 5 <= i) && ret <= unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8])) || (((((i <= 2 && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] <= ret) && 2 <= i) && x == x) && ret <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x]) && x == x) - ProcedureContractResult [Line: 15]: Procedure Contract for sum Derived contract for procedure sum: (((unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] <= ret && 5 <= i) && unknown-#memory_int-unknown[x][x + 12] + (-1 * unknown-#memory_int-unknown[x][16 + x] + \result + 4294967295 + -1 * unknown-#memory_int-unknown[x][x] + -1 * unknown-#memory_int-unknown[x][x + 8] + -1 * unknown-#memory_int-unknown[x][x + 12] + -1 * unknown-#memory_int-unknown[x][x + 4]) / 4294967296 * 4294967296 + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && 2147483648 <= (-1 * unknown-#memory_int-unknown[x][16 + x] + \result + -1 * unknown-#memory_int-unknown[x][x] + -1 * unknown-#memory_int-unknown[x][x + 8] + -1 * unknown-#memory_int-unknown[x][x + 12] + 4294967296 + -1 * unknown-#memory_int-unknown[x][x + 4]) / 4294967296 * 4294967296 + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8]) && ret <= unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] - ProcedureContractResult [Line: 26]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-01-31 18:40:00,155 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...